./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_sync.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_sync.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 19:21:16,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 19:21:16,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 19:21:16,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 19:21:16,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 19:21:16,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 19:21:16,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 19:21:16,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 19:21:16,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 19:21:16,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 19:21:16,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 19:21:16,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 19:21:16,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 19:21:16,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 19:21:16,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 19:21:16,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 19:21:16,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 19:21:16,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 19:21:16,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 19:21:16,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 19:21:16,803 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 19:21:16,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 19:21:16,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 19:21:16,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 19:21:16,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 19:21:16,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 19:21:16,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 19:21:16,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 19:21:16,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 19:21:16,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 19:21:16,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 19:21:16,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 19:21:16,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 19:21:16,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 19:21:16,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 19:21:16,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 19:21:16,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 19:21:16,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 19:21:16,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 19:21:16,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 19:21:16,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 19:21:16,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 19:21:16,824 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 19:21:16,841 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 19:21:16,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 19:21:16,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 19:21:16,842 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 19:21:16,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 19:21:16,843 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 19:21:16,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 19:21:16,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 19:21:16,844 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 19:21:16,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 19:21:16,845 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 19:21:16,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 19:21:16,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 19:21:16,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 19:21:16,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 19:21:16,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 19:21:16,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 19:21:16,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 19:21:16,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 19:21:16,846 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 19:21:16,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 19:21:16,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 19:21:16,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 19:21:16,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 19:21:16,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:21:16,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 19:21:16,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 19:21:16,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 19:21:16,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 19:21:16,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 19:21:16,848 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 19:21:16,848 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 19:21:16,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 19:21:16,849 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef [2022-07-13 19:21:17,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 19:21:17,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 19:21:17,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 19:21:17,075 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 19:21:17,075 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 19:21:17,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_sync.i [2022-07-13 19:21:17,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998f1184d/267f841b0f2444e8bc659f2e4255e317/FLAGede27da81 [2022-07-13 19:21:17,624 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 19:21:17,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2022-07-13 19:21:17,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998f1184d/267f841b0f2444e8bc659f2e4255e317/FLAGede27da81 [2022-07-13 19:21:18,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998f1184d/267f841b0f2444e8bc659f2e4255e317 [2022-07-13 19:21:18,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 19:21:18,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 19:21:18,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 19:21:18,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 19:21:18,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 19:21:18,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299e8366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18, skipping insertion in model container [2022-07-13 19:21:18,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 19:21:18,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 19:21:18,567 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/seq-pthread/cs_sync.i[34698,34711] [2022-07-13 19:21:18,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:21:18,641 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 19:21:18,672 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/seq-pthread/cs_sync.i[34698,34711] [2022-07-13 19:21:18,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:21:18,765 INFO L208 MainTranslator]: Completed translation [2022-07-13 19:21:18,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18 WrapperNode [2022-07-13 19:21:18,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 19:21:18,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 19:21:18,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 19:21:18,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 19:21:18,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,830 INFO L137 Inliner]: procedures = 245, calls = 244, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 544 [2022-07-13 19:21:18,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 19:21:18,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 19:21:18,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 19:21:18,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 19:21:18,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 19:21:18,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 19:21:18,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 19:21:18,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 19:21:18,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:21:18,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:18,960 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-13 19:21:18,987 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-13 19:21:19,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 19:21:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 19:21:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 19:21:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2022-07-13 19:21:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2022-07-13 19:21:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-13 19:21:19,004 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-13 19:21:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 19:21:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 19:21:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 19:21:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-13 19:21:19,005 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-13 19:21:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 19:21:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2022-07-13 19:21:19,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2022-07-13 19:21:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 19:21:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 19:21:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 19:21:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-13 19:21:19,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-13 19:21:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2022-07-13 19:21:19,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2022-07-13 19:21:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-13 19:21:19,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-13 19:21:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:21:19,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:21:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-13 19:21:19,008 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-13 19:21:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 19:21:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 19:21:19,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 19:21:19,202 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 19:21:19,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 19:21:19,542 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:21:19,542 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-13 19:21:19,542 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:21:19,543 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-13 19:21:19,543 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: SUMMARY for call __CS_cs(); srcloc: null [2022-07-13 19:21:19,543 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-13 19:21:19,543 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:21:21,794 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 19:21:21,801 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 19:21:21,802 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-13 19:21:21,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:21:21 BoogieIcfgContainer [2022-07-13 19:21:21,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 19:21:21,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 19:21:21,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 19:21:21,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 19:21:21,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 07:21:18" (1/3) ... [2022-07-13 19:21:21,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316ab111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:21:21, skipping insertion in model container [2022-07-13 19:21:21,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (2/3) ... [2022-07-13 19:21:21,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316ab111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:21:21, skipping insertion in model container [2022-07-13 19:21:21,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:21:21" (3/3) ... [2022-07-13 19:21:21,816 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2022-07-13 19:21:21,829 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 19:21:21,829 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 19:21:21,880 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 19:21:21,889 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@1c2f16b9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2823b264 [2022-07-13 19:21:21,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 19:21:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-13 19:21:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 19:21:21,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:21,910 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:21,911 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:21,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1902090431, now seen corresponding path program 1 times [2022-07-13 19:21:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:21,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974633462] [2022-07-13 19:21:21,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 19:21:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 19:21:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:21:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:21:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 19:21:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 19:21:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 19:21:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 19:21:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 19:21:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 19:21:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 19:21:22,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:22,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974633462] [2022-07-13 19:21:22,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974633462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:22,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:22,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:21:22,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355297091] [2022-07-13 19:21:22,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:22,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:21:22,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:22,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:21:22,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:22,594 INFO L87 Difference]: Start difference. First operand has 194 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:22,673 INFO L93 Difference]: Finished difference Result 390 states and 641 transitions. [2022-07-13 19:21:22,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:21:22,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-07-13 19:21:22,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:22,688 INFO L225 Difference]: With dead ends: 390 [2022-07-13 19:21:22,688 INFO L226 Difference]: Without dead ends: 194 [2022-07-13 19:21:22,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:22,723 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 4 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:22,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 568 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-13 19:21:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2022-07-13 19:21:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 125 states have (on average 1.4) internal successors, (175), 125 states have internal predecessors, (175), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-13 19:21:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 285 transitions. [2022-07-13 19:21:22,784 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 285 transitions. Word has length 72 [2022-07-13 19:21:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:22,785 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 285 transitions. [2022-07-13 19:21:22,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 285 transitions. [2022-07-13 19:21:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 19:21:22,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:22,791 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:22,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 19:21:22,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1569921272, now seen corresponding path program 1 times [2022-07-13 19:21:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:22,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143071392] [2022-07-13 19:21:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 19:21:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:21:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 19:21:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 19:21:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 19:21:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 19:21:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 19:21:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 19:21:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 19:21:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 19:21:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:22,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143071392] [2022-07-13 19:21:22,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143071392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:22,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:22,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:21:22,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036976795] [2022-07-13 19:21:22,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:22,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:21:22,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:22,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:21:22,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:22,989 INFO L87 Difference]: Start difference. First operand 191 states and 285 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:23,052 INFO L93 Difference]: Finished difference Result 381 states and 570 transitions. [2022-07-13 19:21:23,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:21:23,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2022-07-13 19:21:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:23,060 INFO L225 Difference]: With dead ends: 381 [2022-07-13 19:21:23,061 INFO L226 Difference]: Without dead ends: 193 [2022-07-13 19:21:23,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:23,064 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:23,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 561 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-13 19:21:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2022-07-13 19:21:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 126 states have internal predecessors, (176), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-13 19:21:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2022-07-13 19:21:23,084 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 75 [2022-07-13 19:21:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:23,085 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 286 transitions. [2022-07-13 19:21:23,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2022-07-13 19:21:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 19:21:23,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:23,092 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:23,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 19:21:23,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash 217866074, now seen corresponding path program 1 times [2022-07-13 19:21:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:23,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642093895] [2022-07-13 19:21:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 19:21:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 19:21:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:21:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 19:21:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 19:21:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 19:21:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 19:21:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 19:21:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 19:21:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 19:21:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 19:21:23,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:23,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642093895] [2022-07-13 19:21:23,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642093895] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:23,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544229180] [2022-07-13 19:21:23,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:23,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:23,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:23,308 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-13 19:21:23,309 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-13 19:21:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 1763 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 19:21:23,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 19:21:24,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 19:21:24,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544229180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:24,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:24,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-13 19:21:24,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148648273] [2022-07-13 19:21:24,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:24,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 19:21:24,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:24,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 19:21:24,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:21:24,083 INFO L87 Difference]: Start difference. First operand 192 states and 286 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-13 19:21:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:24,141 INFO L93 Difference]: Finished difference Result 385 states and 575 transitions. [2022-07-13 19:21:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 19:21:24,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 77 [2022-07-13 19:21:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:24,144 INFO L225 Difference]: With dead ends: 385 [2022-07-13 19:21:24,144 INFO L226 Difference]: Without dead ends: 196 [2022-07-13 19:21:24,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:21:24,147 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 3 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:24,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1119 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-13 19:21:24,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-07-13 19:21:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-13 19:21:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2022-07-13 19:21:24,164 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 77 [2022-07-13 19:21:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:24,164 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2022-07-13 19:21:24,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-13 19:21:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2022-07-13 19:21:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-13 19:21:24,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:24,166 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:21:24,192 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-13 19:21:24,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:24,384 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:24,384 INFO L85 PathProgramCache]: Analyzing trace with hash 971561630, now seen corresponding path program 2 times [2022-07-13 19:21:24,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:24,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751323248] [2022-07-13 19:21:24,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:24,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:24,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:21:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:24,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 19:21:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:24,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 19:21:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:24,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 19:21:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:24,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 19:21:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:24,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:24,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 19:21:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:24,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 19:21:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:24,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 19:21:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:24,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 19:21:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-07-13 19:21:24,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:24,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751323248] [2022-07-13 19:21:24,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751323248] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:24,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375802718] [2022-07-13 19:21:24,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 19:21:24,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:24,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:24,617 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-13 19:21:24,619 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-13 19:21:25,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 19:21:25,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 19:21:25,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 19:21:25,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 19:21:25,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:21:25,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375802718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:25,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:21:25,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 19:21:25,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701030535] [2022-07-13 19:21:25,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:25,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 19:21:25,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:25,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 19:21:25,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:21:25,567 INFO L87 Difference]: Start difference. First operand 196 states and 290 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:25,600 INFO L93 Difference]: Finished difference Result 377 states and 570 transitions. [2022-07-13 19:21:25,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 19:21:25,600 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), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2022-07-13 19:21:25,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:25,605 INFO L225 Difference]: With dead ends: 377 [2022-07-13 19:21:25,605 INFO L226 Difference]: Without dead ends: 351 [2022-07-13 19:21:25,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:21:25,606 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 230 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:25,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1057 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-13 19:21:25,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2022-07-13 19:21:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 230 states have internal predecessors, (325), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2022-07-13 19:21:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 531 transitions. [2022-07-13 19:21:25,633 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 531 transitions. Word has length 81 [2022-07-13 19:21:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:25,634 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 531 transitions. [2022-07-13 19:21:25,634 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), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 531 transitions. [2022-07-13 19:21:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-13 19:21:25,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:25,639 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-13 19:21:25,667 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-13 19:21:25,864 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,SelfDestructingSolverStorable3 [2022-07-13 19:21:25,864 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:25,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1383247446, now seen corresponding path program 1 times [2022-07-13 19:21:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:25,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006041332] [2022-07-13 19:21:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:25,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 19:21:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:21:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:21:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 19:21:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 19:21:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 19:21:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 19:21:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 19:21:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 19:21:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 19:21:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 19:21:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 19:21:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 19:21:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-13 19:21:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 19:21:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-13 19:21:26,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:26,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006041332] [2022-07-13 19:21:26,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006041332] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:26,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128051249] [2022-07-13 19:21:26,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:26,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:26,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:26,291 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-13 19:21:26,320 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-13 19:21:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 2184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 19:21:27,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-13 19:21:27,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-13 19:21:27,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128051249] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:27,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:27,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-07-13 19:21:27,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126192831] [2022-07-13 19:21:27,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:27,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 19:21:27,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:27,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 19:21:27,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 19:21:27,278 INFO L87 Difference]: Start difference. First operand 350 states and 531 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-13 19:21:29,332 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-13 19:21:31,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:31,979 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2022-07-13 19:21:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 19:21:31,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 183 [2022-07-13 19:21:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:31,983 INFO L225 Difference]: With dead ends: 719 [2022-07-13 19:21:31,983 INFO L226 Difference]: Without dead ends: 381 [2022-07-13 19:21:31,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-13 19:21:31,985 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 108 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 175 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:31,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 929 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 556 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2022-07-13 19:21:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-13 19:21:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 363. [2022-07-13 19:21:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 241 states have (on average 1.3983402489626555) internal successors, (337), 243 states have internal predecessors, (337), 99 states have call successors, (99), 20 states have call predecessors, (99), 22 states have return successors, (111), 99 states have call predecessors, (111), 99 states have call successors, (111) [2022-07-13 19:21:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 547 transitions. [2022-07-13 19:21:32,011 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 547 transitions. Word has length 183 [2022-07-13 19:21:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:32,012 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 547 transitions. [2022-07-13 19:21:32,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-13 19:21:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 547 transitions. [2022-07-13 19:21:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-13 19:21:32,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:32,016 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-13 19:21:32,049 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-13 19:21:32,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:32,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:32,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash -945252521, now seen corresponding path program 2 times [2022-07-13 19:21:32,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:32,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931292509] [2022-07-13 19:21:32,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:21:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:21:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:21:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 19:21:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 19:21:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 19:21:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 19:21:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 19:21:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 19:21:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 19:21:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 19:21:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 19:21:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 19:21:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 19:21:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 19:21:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2022-07-13 19:21:47,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:47,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931292509] [2022-07-13 19:21:47,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931292509] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:47,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39728889] [2022-07-13 19:21:47,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 19:21:47,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:47,465 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-13 19:21:47,468 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-13 19:21:48,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 19:21:48,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 19:21:48,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 19:21:48,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-07-13 19:21:48,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:21:48,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39728889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:48,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:21:48,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-13 19:21:48,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953268838] [2022-07-13 19:21:48,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:48,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:21:48,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:48,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:21:48,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-13 19:21:48,504 INFO L87 Difference]: Start difference. First operand 363 states and 547 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-13 19:21:48,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:48,528 INFO L93 Difference]: Finished difference Result 695 states and 1053 transitions. [2022-07-13 19:21:48,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:21:48,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 192 [2022-07-13 19:21:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:48,532 INFO L225 Difference]: With dead ends: 695 [2022-07-13 19:21:48,532 INFO L226 Difference]: Without dead ends: 363 [2022-07-13 19:21:48,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-13 19:21:48,535 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:48,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-13 19:21:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2022-07-13 19:21:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 243 states have internal predecessors, (336), 99 states have call successors, (99), 20 states have call predecessors, (99), 22 states have return successors, (111), 99 states have call predecessors, (111), 99 states have call successors, (111) [2022-07-13 19:21:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 546 transitions. [2022-07-13 19:21:48,563 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 546 transitions. Word has length 192 [2022-07-13 19:21:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:48,563 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 546 transitions. [2022-07-13 19:21:48,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-13 19:21:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 546 transitions. [2022-07-13 19:21:48,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-13 19:21:48,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:48,568 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 19:21:48,596 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-13 19:21:48,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:48,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:48,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash 342116215, now seen corresponding path program 1 times [2022-07-13 19:21:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:48,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331928814] [2022-07-13 19:21:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:48,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:21:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:21:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 19:21:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:21:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:21:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 19:21:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 19:21:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 19:21:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-13 19:21:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-13 19:21:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 19:21:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 19:21:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 19:21:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-13 19:21:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-13 19:21:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-13 19:21:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-13 19:21:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-13 19:21:49,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:49,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331928814] [2022-07-13 19:21:49,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331928814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:49,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198047246] [2022-07-13 19:21:49,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:49,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:49,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:49,308 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-13 19:21:49,335 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-13 19:21:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:50,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 2532 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 19:21:50,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:50,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-07-13 19:21:50,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-13 19:21:50,501 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 11 treesize of output 7 [2022-07-13 19:21:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 400 proven. 5 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2022-07-13 19:21:50,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:50,590 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 12 treesize of output 8 [2022-07-13 19:21:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2022-07-13 19:21:50,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198047246] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:50,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:50,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-07-13 19:21:50,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724351425] [2022-07-13 19:21:50,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:50,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 19:21:50,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:50,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 19:21:50,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-13 19:21:50,811 INFO L87 Difference]: Start difference. First operand 363 states and 546 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 8 states have internal predecessors, (108), 8 states have call successors, (41), 8 states have call predecessors, (41), 6 states have return successors, (39), 8 states have call predecessors, (39), 8 states have call successors, (39) [2022-07-13 19:21:52,841 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-13 19:21:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:54,712 INFO L93 Difference]: Finished difference Result 845 states and 1305 transitions. [2022-07-13 19:21:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 19:21:54,713 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 8 states have internal predecessors, (108), 8 states have call successors, (41), 8 states have call predecessors, (41), 6 states have return successors, (39), 8 states have call predecessors, (39), 8 states have call successors, (39) Word has length 220 [2022-07-13 19:21:54,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:54,719 INFO L225 Difference]: With dead ends: 845 [2022-07-13 19:21:54,720 INFO L226 Difference]: Without dead ends: 815 [2022-07-13 19:21:54,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2022-07-13 19:21:54,721 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 673 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 663 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:54,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1126 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 1619 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-07-13 19:21:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2022-07-13 19:21:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 754. [2022-07-13 19:21:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 489 states have (on average 1.4110429447852761) internal successors, (690), 496 states have internal predecessors, (690), 215 states have call successors, (215), 40 states have call predecessors, (215), 49 states have return successors, (265), 217 states have call predecessors, (265), 215 states have call successors, (265) [2022-07-13 19:21:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1170 transitions. [2022-07-13 19:21:54,766 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1170 transitions. Word has length 220 [2022-07-13 19:21:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:54,767 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 1170 transitions. [2022-07-13 19:21:54,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 8 states have internal predecessors, (108), 8 states have call successors, (41), 8 states have call predecessors, (41), 6 states have return successors, (39), 8 states have call predecessors, (39), 8 states have call successors, (39) [2022-07-13 19:21:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1170 transitions. [2022-07-13 19:21:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-13 19:21:54,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:54,773 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 19:21:54,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:54,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:54,980 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:54,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash -26567542, now seen corresponding path program 1 times [2022-07-13 19:21:54,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:54,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914631741] [2022-07-13 19:21:54,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:54,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:22:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:22:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:22:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 19:22:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:22:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:22:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:22:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:22:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 19:22:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 19:22:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 19:22:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 19:22:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 19:22:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 19:22:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 19:22:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-13 19:22:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 19:22:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-13 19:22:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-13 19:22:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-13 19:22:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2022-07-13 19:22:01,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:22:01,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914631741] [2022-07-13 19:22:01,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914631741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:22:01,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747146254] [2022-07-13 19:22:01,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:01,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:01,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:22:01,287 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:22:01,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 19:22:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:02,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 2496 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 19:22:02,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2022-07-13 19:22:02,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:22:02,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747146254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:22:02,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:22:02,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2022-07-13 19:22:02,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141825180] [2022-07-13 19:22:02,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:22:02,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 19:22:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:22:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 19:22:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-13 19:22:02,702 INFO L87 Difference]: Start difference. First operand 754 states and 1170 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-13 19:22:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:03,455 INFO L93 Difference]: Finished difference Result 1731 states and 2851 transitions. [2022-07-13 19:22:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 19:22:03,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) Word has length 221 [2022-07-13 19:22:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:03,462 INFO L225 Difference]: With dead ends: 1731 [2022-07-13 19:22:03,462 INFO L226 Difference]: Without dead ends: 1001 [2022-07-13 19:22:03,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-13 19:22:03,468 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 418 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:03,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 500 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 19:22:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-07-13 19:22:03,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 963. [2022-07-13 19:22:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 676 states have (on average 1.3032544378698225) internal successors, (881), 574 states have internal predecessors, (881), 225 states have call successors, (225), 41 states have call predecessors, (225), 61 states have return successors, (412), 347 states have call predecessors, (412), 225 states have call successors, (412) [2022-07-13 19:22:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1518 transitions. [2022-07-13 19:22:03,561 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1518 transitions. Word has length 221 [2022-07-13 19:22:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:03,561 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1518 transitions. [2022-07-13 19:22:03,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-13 19:22:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1518 transitions. [2022-07-13 19:22:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-13 19:22:03,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:03,567 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:22:03,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:03,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:03,794 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:03,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2076186120, now seen corresponding path program 1 times [2022-07-13 19:22:03,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:22:03,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419304246] [2022-07-13 19:22:03,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:03,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:22:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:22:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:22:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 19:22:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:22:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:22:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:22:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:22:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 19:22:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 19:22:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 19:22:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 19:22:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 19:22:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 19:22:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 19:22:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-13 19:22:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 19:22:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-13 19:22:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-13 19:22:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-13 19:22:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-13 19:22:04,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:22:04,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419304246] [2022-07-13 19:22:04,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419304246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:22:04,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810251221] [2022-07-13 19:22:04,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:04,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:04,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:22:04,241 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:22:04,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 19:22:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:05,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 2471 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 19:22:05,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:05,383 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-13 19:22:05,391 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-13 19:22:05,409 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 11 treesize of output 7 [2022-07-13 19:22:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2022-07-13 19:22:05,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:22:05,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810251221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:22:05,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:22:05,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-13 19:22:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72755820] [2022-07-13 19:22:05,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:22:05,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 19:22:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:22:05,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 19:22:05,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-13 19:22:05,426 INFO L87 Difference]: Start difference. First operand 963 states and 1518 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-13 19:22:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:05,649 INFO L93 Difference]: Finished difference Result 1940 states and 3040 transitions. [2022-07-13 19:22:05,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 19:22:05,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 221 [2022-07-13 19:22:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:05,657 INFO L225 Difference]: With dead ends: 1940 [2022-07-13 19:22:05,658 INFO L226 Difference]: Without dead ends: 1017 [2022-07-13 19:22:05,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-13 19:22:05,663 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 301 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:05,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 965 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 19:22:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2022-07-13 19:22:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 975. [2022-07-13 19:22:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 684 states have (on average 1.2997076023391814) internal successors, (889), 586 states have internal predecessors, (889), 225 states have call successors, (225), 41 states have call predecessors, (225), 65 states have return successors, (418), 347 states have call predecessors, (418), 225 states have call successors, (418) [2022-07-13 19:22:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1532 transitions. [2022-07-13 19:22:05,749 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1532 transitions. Word has length 221 [2022-07-13 19:22:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:05,749 INFO L495 AbstractCegarLoop]: Abstraction has 975 states and 1532 transitions. [2022-07-13 19:22:05,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-13 19:22:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1532 transitions. [2022-07-13 19:22:05,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-13 19:22:05,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:05,755 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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] [2022-07-13 19:22:05,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:05,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:05,976 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:05,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:05,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1342111146, now seen corresponding path program 1 times [2022-07-13 19:22:05,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:22:05,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100382198] [2022-07-13 19:22:05,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:05,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:22:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:22:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:22:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 19:22:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:22:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:22:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:22:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:22:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 19:22:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 19:22:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 19:22:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-13 19:22:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-13 19:22:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 19:22:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 19:22:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 19:22:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-13 19:22:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-13 19:22:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-13 19:22:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-13 19:22:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2022-07-13 19:22:14,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:22:14,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100382198] [2022-07-13 19:22:14,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100382198] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:22:14,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874403310] [2022-07-13 19:22:14,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:14,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:14,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:22:14,462 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:22:14,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 19:22:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 2499 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 19:22:15,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2022-07-13 19:22:15,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:22:15,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874403310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:22:15,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:22:15,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2022-07-13 19:22:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309817513] [2022-07-13 19:22:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:22:15,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 19:22:15,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:22:15,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 19:22:15,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-13 19:22:15,835 INFO L87 Difference]: Start difference. First operand 975 states and 1532 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-13 19:22:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:17,364 INFO L93 Difference]: Finished difference Result 2599 states and 4124 transitions. [2022-07-13 19:22:17,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 19:22:17,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 220 [2022-07-13 19:22:17,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:17,377 INFO L225 Difference]: With dead ends: 2599 [2022-07-13 19:22:17,378 INFO L226 Difference]: Without dead ends: 1648 [2022-07-13 19:22:17,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-07-13 19:22:17,387 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 406 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:17,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1064 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 19:22:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-07-13 19:22:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1440. [2022-07-13 19:22:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 989 states have (on average 1.2810920121334681) internal successors, (1267), 899 states have internal predecessors, (1267), 342 states have call successors, (342), 63 states have call predecessors, (342), 108 states have return successors, (648), 477 states have call predecessors, (648), 342 states have call successors, (648) [2022-07-13 19:22:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2257 transitions. [2022-07-13 19:22:17,547 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2257 transitions. Word has length 220 [2022-07-13 19:22:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:17,548 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 2257 transitions. [2022-07-13 19:22:17,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-13 19:22:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2257 transitions. [2022-07-13 19:22:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-13 19:22:17,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:17,554 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:22:17,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:17,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 19:22:17,776 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:17,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:17,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2117807204, now seen corresponding path program 1 times [2022-07-13 19:22:17,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:22:17,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012784997] [2022-07-13 19:22:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:17,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:22:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:22:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:22:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 19:22:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:22:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:22:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:22:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 19:22:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 19:22:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 19:22:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 19:22:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 19:22:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:32,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 19:22:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 19:22:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:32,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 19:22:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-13 19:22:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 19:22:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:32,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-13 19:22:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:32,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-13 19:22:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-13 19:22:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-13 19:22:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:22:32,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012784997] [2022-07-13 19:22:32,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012784997] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:22:32,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376063519] [2022-07-13 19:22:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:32,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:32,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:22:32,029 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:22:32,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 19:22:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:33,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-13 19:22:33,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:33,741 INFO L356 Elim1Store]: treesize reduction 144, result has 14.8 percent of original size [2022-07-13 19:22:33,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 96 treesize of output 106 [2022-07-13 19:22:33,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2022-07-13 19:22:34,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:22:34,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:22:34,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:22:34,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2022-07-13 19:22:35,005 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 19 treesize of output 23 [2022-07-13 19:22:35,088 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 19 treesize of output 23 [2022-07-13 19:22:35,184 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 19 treesize of output 23 [2022-07-13 19:22:35,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:35,535 INFO L356 Elim1Store]: treesize reduction 315, result has 24.1 percent of original size [2022-07-13 19:22:35,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 720 treesize of output 318 [2022-07-13 19:22:35,581 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-13 19:22:35,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-13 19:22:35,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-13 19:22:35,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 19:22:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 185 proven. 33 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2022-07-13 19:22:35,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:22:36,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#num~0.offset| Int) (v_ArrVal_19061 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:22:36,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:22:36,409 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:22:36,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:22:36,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:22:36,563 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:22:36,626 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19027 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19026 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:22:36,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19057 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19027 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19026 (Array Int Int)) (v_ArrVal_19025 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19024 (Array Int Int)) (v_ArrVal_19046 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19024) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19025) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:22:36,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19057 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (v_ArrVal_19023 (Array Int Int)) (v_ArrVal_19022 (Array Int Int)) (v_ArrVal_19021 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19020 (Array Int Int)) (v_ArrVal_19027 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19026 (Array Int Int)) (v_ArrVal_19025 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19024 (Array Int Int)) (v_ArrVal_19046 (Array Int Int))) (not (= 1 (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19020) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19023) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19021) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19022) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19024) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19025) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256)))) is different from false [2022-07-13 19:22:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 854 trivial. 47 not checked. [2022-07-13 19:22:37,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376063519] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:22:37,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:22:37,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 15] total 33 [2022-07-13 19:22:37,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012596630] [2022-07-13 19:22:37,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:22:37,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 19:22:37,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:22:37,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 19:22:37,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=455, Unknown=9, NotChecked=468, Total=1056 [2022-07-13 19:22:37,022 INFO L87 Difference]: Start difference. First operand 1440 states and 2257 transitions. Second operand has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 29 states have internal predecessors, (176), 9 states have call successors, (50), 9 states have call predecessors, (50), 6 states have return successors, (44), 9 states have call predecessors, (44), 9 states have call successors, (44) [2022-07-13 19:22:39,458 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-13 19:22:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:41,315 INFO L93 Difference]: Finished difference Result 2292 states and 3433 transitions. [2022-07-13 19:22:41,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 19:22:41,316 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 29 states have internal predecessors, (176), 9 states have call successors, (50), 9 states have call predecessors, (50), 6 states have return successors, (44), 9 states have call predecessors, (44), 9 states have call successors, (44) Word has length 221 [2022-07-13 19:22:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:41,329 INFO L225 Difference]: With dead ends: 2292 [2022-07-13 19:22:41,330 INFO L226 Difference]: Without dead ends: 1626 [2022-07-13 19:22:41,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 486 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=276, Invalid=1083, Unknown=9, NotChecked=702, Total=2070 [2022-07-13 19:22:41,335 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 453 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 354 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 5006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 3177 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:41,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1125 Invalid, 5006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1474 Invalid, 1 Unknown, 3177 Unchecked, 3.4s Time] [2022-07-13 19:22:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2022-07-13 19:22:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1552. [2022-07-13 19:22:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1074 states have (on average 1.266294227188082) internal successors, (1360), 986 states have internal predecessors, (1360), 353 states have call successors, (353), 69 states have call predecessors, (353), 124 states have return successors, (693), 496 states have call predecessors, (693), 353 states have call successors, (693) [2022-07-13 19:22:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2406 transitions. [2022-07-13 19:22:41,483 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2406 transitions. Word has length 221 [2022-07-13 19:22:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:41,484 INFO L495 AbstractCegarLoop]: Abstraction has 1552 states and 2406 transitions. [2022-07-13 19:22:41,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 29 states have internal predecessors, (176), 9 states have call successors, (50), 9 states have call predecessors, (50), 6 states have return successors, (44), 9 states have call predecessors, (44), 9 states have call successors, (44) [2022-07-13 19:22:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2406 transitions. [2022-07-13 19:22:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-13 19:22:41,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:41,491 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:22:41,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:41,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:41,707 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash 857070716, now seen corresponding path program 1 times [2022-07-13 19:22:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:22:41,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268358774] [2022-07-13 19:22:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:41,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:22:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:22:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:22:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 19:22:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:22:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:22:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:22:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 19:22:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 19:22:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 19:22:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 19:22:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 19:22:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 19:22:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 19:22:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 19:22:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-13 19:22:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 19:22:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-13 19:22:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-13 19:22:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-13 19:22:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2022-07-13 19:22:50,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:22:50,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268358774] [2022-07-13 19:22:50,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268358774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:22:50,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354751920] [2022-07-13 19:22:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:50,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:50,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:22:50,595 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:22:50,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 19:22:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:51,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 2479 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 19:22:51,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:51,885 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-13 19:22:51,889 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-13 19:22:51,904 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-13 19:22:51,906 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-13 19:22:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2022-07-13 19:22:51,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:22:51,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354751920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:22:51,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:22:51,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2022-07-13 19:22:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193251585] [2022-07-13 19:22:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:22:51,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 19:22:51,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:22:51,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 19:22:51,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 19:22:51,933 INFO L87 Difference]: Start difference. First operand 1552 states and 2406 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-13 19:22:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:52,177 INFO L93 Difference]: Finished difference Result 3135 states and 4822 transitions. [2022-07-13 19:22:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 19:22:52,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 222 [2022-07-13 19:22:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:52,189 INFO L225 Difference]: With dead ends: 3135 [2022-07-13 19:22:52,189 INFO L226 Difference]: Without dead ends: 1600 [2022-07-13 19:22:52,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 19:22:52,197 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 335 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:52,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 904 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 19:22:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2022-07-13 19:22:52,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1531. [2022-07-13 19:22:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1059 states have (on average 1.267233238904627) internal successors, (1342), 972 states have internal predecessors, (1342), 350 states have call successors, (350), 67 states have call predecessors, (350), 121 states have return successors, (685), 491 states have call predecessors, (685), 350 states have call successors, (685) [2022-07-13 19:22:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2377 transitions. [2022-07-13 19:22:52,337 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2377 transitions. Word has length 222 [2022-07-13 19:22:52,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:52,337 INFO L495 AbstractCegarLoop]: Abstraction has 1531 states and 2377 transitions. [2022-07-13 19:22:52,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-13 19:22:52,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2377 transitions. [2022-07-13 19:22:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-13 19:22:52,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:52,344 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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] [2022-07-13 19:22:52,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:52,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 19:22:52,571 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:52,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:52,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2138421081, now seen corresponding path program 1 times [2022-07-13 19:22:52,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:22:52,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248216229] [2022-07-13 19:22:52,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:52,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:22:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:22:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:22:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 19:22:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:22:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:22:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:22:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 19:22:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 19:22:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 19:22:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:22:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 19:22:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 19:22:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 19:22:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 19:22:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 19:22:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-13 19:22:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 19:22:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-13 19:22:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-13 19:22:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-13 19:22:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:52,971 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2022-07-13 19:22:52,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:22:52,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248216229] [2022-07-13 19:22:52,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248216229] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:22:52,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082011273] [2022-07-13 19:22:52,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:52,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:52,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:22:52,976 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:22:53,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 19:22:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:54,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 19:22:54,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:54,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-07-13 19:22:54,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-13 19:22:54,487 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 11 treesize of output 7 [2022-07-13 19:22:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 400 proven. 5 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2022-07-13 19:22:54,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:22:54,571 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 12 treesize of output 8 [2022-07-13 19:22:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 899 trivial. 0 not checked. [2022-07-13 19:22:54,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082011273] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:22:54,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:22:54,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-07-13 19:22:54,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845651356] [2022-07-13 19:22:54,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:22:54,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 19:22:54,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:22:54,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 19:22:54,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-13 19:22:54,744 INFO L87 Difference]: Start difference. First operand 1531 states and 2377 transitions. Second operand has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 8 states have internal predecessors, (110), 8 states have call successors, (43), 8 states have call predecessors, (43), 6 states have return successors, (41), 8 states have call predecessors, (41), 8 states have call successors, (41) [2022-07-13 19:22:56,787 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-13 19:22:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:58,665 INFO L93 Difference]: Finished difference Result 3088 states and 4719 transitions. [2022-07-13 19:22:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 19:22:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 8 states have internal predecessors, (110), 8 states have call successors, (43), 8 states have call predecessors, (43), 6 states have return successors, (41), 8 states have call predecessors, (41), 8 states have call successors, (41) Word has length 221 [2022-07-13 19:22:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:58,675 INFO L225 Difference]: With dead ends: 3088 [2022-07-13 19:22:58,675 INFO L226 Difference]: Without dead ends: 1446 [2022-07-13 19:22:58,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2022-07-13 19:22:58,684 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 654 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 426 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:58,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 982 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 1653 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-07-13 19:22:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2022-07-13 19:22:58,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1330. [2022-07-13 19:22:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 925 states have (on average 1.2540540540540541) internal successors, (1160), 856 states have internal predecessors, (1160), 293 states have call successors, (293), 64 states have call predecessors, (293), 111 states have return successors, (539), 409 states have call predecessors, (539), 293 states have call successors, (539) [2022-07-13 19:22:58,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1992 transitions. [2022-07-13 19:22:58,851 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1992 transitions. Word has length 221 [2022-07-13 19:22:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:58,851 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1992 transitions. [2022-07-13 19:22:58,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 8 states have internal predecessors, (110), 8 states have call successors, (43), 8 states have call predecessors, (43), 6 states have return successors, (41), 8 states have call predecessors, (41), 8 states have call successors, (41) [2022-07-13 19:22:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1992 transitions. [2022-07-13 19:22:58,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-13 19:22:58,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:58,856 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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] [2022-07-13 19:22:58,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:59,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 19:22:59,076 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1032257057, now seen corresponding path program 1 times [2022-07-13 19:22:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:22:59,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782175632] [2022-07-13 19:22:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:23:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:23:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:23:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:23:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:23:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 19:23:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:23:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:23:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:23:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:23:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:23:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:23:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:23:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 19:23:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:23:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:23:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 19:23:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 19:23:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:23:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:23:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 19:23:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 19:23:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 19:23:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 19:23:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 19:23:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-13 19:23:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 19:23:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-13 19:23:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-13 19:23:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-13 19:23:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2022-07-13 19:23:24,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:23:24,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782175632] [2022-07-13 19:23:24,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782175632] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:23:24,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647186656] [2022-07-13 19:23:24,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:23:24,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:23:24,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:23:24,108 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:23:24,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 19:23:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:25,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 194 conjunts are in the unsatisfiable core [2022-07-13 19:23:25,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:23:26,016 INFO L356 Elim1Store]: treesize reduction 200, result has 50.1 percent of original size [2022-07-13 19:23:26,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 28 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 50 case distinctions, treesize of input 366 treesize of output 534 [2022-07-13 19:23:30,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-07-13 19:23:30,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:30,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 25 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-07-13 19:23:31,213 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 19:23:31,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-13 19:23:31,797 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 19:23:31,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-13 19:23:32,444 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 19:23:32,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-13 19:23:34,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:34,319 INFO L356 Elim1Store]: treesize reduction 120, result has 13.7 percent of original size [2022-07-13 19:23:34,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 356 treesize of output 145 [2022-07-13 19:23:34,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:34,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:34,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:34,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:34,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:34,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:34,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 55 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 107 [2022-07-13 19:23:34,357 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 16 treesize of output 15 [2022-07-13 19:23:34,367 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 16 treesize of output 15 [2022-07-13 19:23:34,378 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-13 19:23:34,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 28 [2022-07-13 19:23:34,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 18 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2022-07-13 19:23:35,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 18 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2022-07-13 19:23:35,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 19:23:35,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 19:23:41,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:23:41,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-07-13 19:23:42,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 19:23:42,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 18 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-07-13 19:23:42,886 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 13 treesize of output 9 [2022-07-13 19:23:52,581 INFO L356 Elim1Store]: treesize reduction 16, result has 75.4 percent of original size [2022-07-13 19:23:52,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 64 [2022-07-13 19:23:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 377 proven. 351 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-07-13 19:23:52,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:23:53,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647186656] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:23:53,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 19:23:53,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 34] total 43 [2022-07-13 19:23:53,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022420715] [2022-07-13 19:23:53,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 19:23:53,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-13 19:23:53,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:23:53,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-13 19:23:53,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1907, Unknown=75, NotChecked=0, Total=2162 [2022-07-13 19:23:53,224 INFO L87 Difference]: Start difference. First operand 1330 states and 1992 transitions. Second operand has 43 states, 40 states have (on average 4.3) internal successors, (172), 39 states have internal predecessors, (172), 17 states have call successors, (46), 13 states have call predecessors, (46), 15 states have return successors, (46), 13 states have call predecessors, (46), 17 states have call successors, (46) [2022-07-13 19:23:57,500 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-13 19:23:59,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:24:04,422 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-13 19:24:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:24:13,775 INFO L93 Difference]: Finished difference Result 2275 states and 3209 transitions. [2022-07-13 19:24:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-13 19:24:13,776 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 4.3) internal successors, (172), 39 states have internal predecessors, (172), 17 states have call successors, (46), 13 states have call predecessors, (46), 15 states have return successors, (46), 13 states have call predecessors, (46), 17 states have call successors, (46) Word has length 221 [2022-07-13 19:24:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:24:13,784 INFO L225 Difference]: With dead ends: 2275 [2022-07-13 19:24:13,784 INFO L226 Difference]: Without dead ends: 1404 [2022-07-13 19:24:13,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 317 SyntacticMatches, 12 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=523, Invalid=4587, Unknown=146, NotChecked=0, Total=5256 [2022-07-13 19:24:13,789 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 229 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 233 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1177 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-07-13 19:24:13,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 3034 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1511 Invalid, 1 Unknown, 1177 Unchecked, 12.2s Time] [2022-07-13 19:24:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-07-13 19:24:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1335. [2022-07-13 19:24:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 928 states have (on average 1.25) internal successors, (1160), 858 states have internal predecessors, (1160), 295 states have call successors, (295), 67 states have call predecessors, (295), 111 states have return successors, (539), 409 states have call predecessors, (539), 295 states have call successors, (539) [2022-07-13 19:24:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1994 transitions. [2022-07-13 19:24:13,919 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1994 transitions. Word has length 221 [2022-07-13 19:24:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:24:13,919 INFO L495 AbstractCegarLoop]: Abstraction has 1335 states and 1994 transitions. [2022-07-13 19:24:13,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 4.3) internal successors, (172), 39 states have internal predecessors, (172), 17 states have call successors, (46), 13 states have call predecessors, (46), 15 states have return successors, (46), 13 states have call predecessors, (46), 17 states have call successors, (46) [2022-07-13 19:24:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1994 transitions. [2022-07-13 19:24:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-07-13 19:24:13,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:24:13,924 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 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] [2022-07-13 19:24:13,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 19:24:14,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 19:24:14,143 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:24:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:24:14,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2098594334, now seen corresponding path program 1 times [2022-07-13 19:24:14,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:24:14,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224098931] [2022-07-13 19:24:14,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:24:14,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:24:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:24:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:24:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:24:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:24:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 19:24:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:24:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:24:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 19:24:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:24:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:24:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:24:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:24:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:24:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:24:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:24:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 19:24:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:24:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:24:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 19:24:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 19:24:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:24:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:24:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 19:24:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 19:24:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-13 19:24:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 19:24:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-13 19:24:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-13 19:24:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-13 19:24:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-13 19:24:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-13 19:24:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-13 19:24:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2022-07-13 19:24:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:24:25,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224098931] [2022-07-13 19:24:25,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224098931] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:24:25,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904248989] [2022-07-13 19:24:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:24:25,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:24:25,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:24:25,501 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:24:25,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 19:24:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:24:27,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 2568 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-13 19:24:27,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:24:27,839 INFO L356 Elim1Store]: treesize reduction 144, result has 14.8 percent of original size [2022-07-13 19:24:27,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 96 treesize of output 106 [2022-07-13 19:24:28,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2022-07-13 19:24:28,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:24:28,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:24:28,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 19:24:29,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2022-07-13 19:24:29,423 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 19 treesize of output 23 [2022-07-13 19:24:29,498 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 19 treesize of output 23 [2022-07-13 19:24:29,575 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 29 treesize of output 31 [2022-07-13 19:24:29,582 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-13 19:24:29,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:29,914 INFO L356 Elim1Store]: treesize reduction 315, result has 24.1 percent of original size [2022-07-13 19:24:29,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 120 [2022-07-13 19:24:29,942 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-13 19:24:29,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-13 19:24:30,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-13 19:24:30,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 19:24:30,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:24:30,300 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-13 19:24:30,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 19:24:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 365 proven. 33 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-07-13 19:24:30,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:24:30,561 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_27275 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_~#num~0.base| v_ArrVal_27275) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-13 19:24:30,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904248989] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:24:30,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 19:24:30,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2022-07-13 19:24:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262402729] [2022-07-13 19:24:30,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 19:24:30,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 19:24:30,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:24:30,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 19:24:30,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=499, Unknown=2, NotChecked=46, Total=650 [2022-07-13 19:24:30,564 INFO L87 Difference]: Start difference. First operand 1335 states and 1994 transitions. Second operand has 23 states, 23 states have (on average 6.217391304347826) internal successors, (143), 19 states have internal predecessors, (143), 9 states have call successors, (46), 8 states have call predecessors, (46), 5 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) [2022-07-13 19:24:32,748 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-13 19:24:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:24:35,052 INFO L93 Difference]: Finished difference Result 2306 states and 3246 transitions. [2022-07-13 19:24:35,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 19:24:35,053 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.217391304347826) internal successors, (143), 19 states have internal predecessors, (143), 9 states have call successors, (46), 8 states have call predecessors, (46), 5 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) Word has length 240 [2022-07-13 19:24:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:24:35,064 INFO L225 Difference]: With dead ends: 2306 [2022-07-13 19:24:35,064 INFO L226 Difference]: Without dead ends: 1983 [2022-07-13 19:24:35,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=1350, Unknown=13, NotChecked=78, Total=1722 [2022-07-13 19:24:35,068 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 515 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 433 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-13 19:24:35,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1564 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2139 Invalid, 1 Unknown, 247 Unchecked, 3.9s Time] [2022-07-13 19:24:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2022-07-13 19:24:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1810. [2022-07-13 19:24:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1261 states have (on average 1.2307692307692308) internal successors, (1552), 1191 states have internal predecessors, (1552), 380 states have call successors, (380), 105 states have call predecessors, (380), 168 states have return successors, (673), 513 states have call predecessors, (673), 380 states have call successors, (673) [2022-07-13 19:24:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2605 transitions. [2022-07-13 19:24:35,228 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2605 transitions. Word has length 240 [2022-07-13 19:24:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:24:35,228 INFO L495 AbstractCegarLoop]: Abstraction has 1810 states and 2605 transitions. [2022-07-13 19:24:35,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.217391304347826) internal successors, (143), 19 states have internal predecessors, (143), 9 states have call successors, (46), 8 states have call predecessors, (46), 5 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) [2022-07-13 19:24:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2605 transitions. [2022-07-13 19:24:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-07-13 19:24:35,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:24:35,246 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 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] [2022-07-13 19:24:35,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 19:24:35,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 19:24:35,469 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:24:35,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:24:35,470 INFO L85 PathProgramCache]: Analyzing trace with hash -59290204, now seen corresponding path program 1 times [2022-07-13 19:24:35,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:24:35,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137404275] [2022-07-13 19:24:35,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:24:35,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:25:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat