./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stack-2.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 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 07:40:30,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 07:40:30,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 07:40:30,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 07:40:30,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 07:40:30,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 07:40:30,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 07:40:30,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 07:40:30,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 07:40:30,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 07:40:30,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 07:40:30,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 07:40:30,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 07:40:30,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 07:40:30,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 07:40:30,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 07:40:30,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 07:40:30,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 07:40:30,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 07:40:30,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 07:40:30,098 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 07:40:30,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 07:40:30,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 07:40:30,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 07:40:30,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 07:40:30,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 07:40:30,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 07:40:30,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 07:40:30,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 07:40:30,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 07:40:30,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 07:40:30,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 07:40:30,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 07:40:30,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 07:40:30,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 07:40:30,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 07:40:30,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 07:40:30,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 07:40:30,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 07:40:30,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 07:40:30,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 07:40:30,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 07:40:30,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 07:40:30,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 07:40:30,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 07:40:30,141 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 07:40:30,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 07:40:30,142 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 07:40:30,142 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 07:40:30,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 07:40:30,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 07:40:30,143 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 07:40:30,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 07:40:30,144 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 07:40:30,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 07:40:30,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 07:40:30,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 07:40:30,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 07:40:30,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 07:40:30,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 07:40:30,145 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 07:40:30,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 07:40:30,145 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 07:40:30,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 07:40:30,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 07:40:30,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 07:40:30,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 07:40:30,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 07:40:30,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 07:40:30,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 07:40:30,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 07:40:30,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 07:40:30,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 07:40:30,147 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 07:40:30,147 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 07:40:30,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 07:40:30,147 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 -> 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 [2022-07-12 07:40:30,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 07:40:30,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 07:40:30,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 07:40:30,364 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 07:40:30,365 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 07:40:30,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stack-2.i [2022-07-12 07:40:30,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18bd85df9/409f02b455044c8188b58c4ae1705c83/FLAG6a78be4d2 [2022-07-12 07:40:30,852 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 07:40:30,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i [2022-07-12 07:40:30,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18bd85df9/409f02b455044c8188b58c4ae1705c83/FLAG6a78be4d2 [2022-07-12 07:40:30,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18bd85df9/409f02b455044c8188b58c4ae1705c83 [2022-07-12 07:40:30,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 07:40:30,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 07:40:30,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 07:40:30,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 07:40:30,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 07:40:30,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:40:30" (1/1) ... [2022-07-12 07:40:30,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4547870f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:30, skipping insertion in model container [2022-07-12 07:40:30,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:40:30" (1/1) ... [2022-07-12 07:40:30,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 07:40:30,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 07:40:31,294 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_stack-2.i[34556,34569] [2022-07-12 07:40:31,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 07:40:31,405 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 07:40:31,461 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_stack-2.i[34556,34569] [2022-07-12 07:40:31,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 07:40:31,544 INFO L208 MainTranslator]: Completed translation [2022-07-12 07:40:31,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:31 WrapperNode [2022-07-12 07:40:31,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 07:40:31,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 07:40:31,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 07:40:31,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 07:40:31,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:31" (1/1) ... [2022-07-12 07:40:31,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:31" (1/1) ... [2022-07-12 07:40:31,614 INFO L137 Inliner]: procedures = 252, calls = 270, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 603 [2022-07-12 07:40:31,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 07:40:31,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 07:40:31,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 07:40:31,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 07:40:31,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:31" (1/1) ... [2022-07-12 07:40:31,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:31" (1/1) ... [2022-07-12 07:40:31,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:31" (1/1) ... [2022-07-12 07:40:31,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:31" (1/1) ... [2022-07-12 07:40:31,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:31" (1/1) ... [2022-07-12 07:40:31,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:31" (1/1) ... [2022-07-12 07:40:31,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:31" (1/1) ... [2022-07-12 07:40:31,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 07:40:31,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 07:40:31,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 07:40:31,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 07:40:31,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:31" (1/1) ... [2022-07-12 07:40:31,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 07:40:31,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:31,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 07:40:31,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 07:40:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 07:40:31,738 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 07:40:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 07:40:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-12 07:40:31,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-12 07:40:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 07:40:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 07:40:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 07:40:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-12 07:40:31,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-12 07:40:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 07:40:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 07:40:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2022-07-12 07:40:31,740 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2022-07-12 07:40:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 07:40:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 07:40:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-12 07:40:31,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-12 07:40:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-12 07:40:31,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-12 07:40:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-12 07:40:31,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-12 07:40:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-07-12 07:40:31,741 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-07-12 07:40:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-12 07:40:31,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-12 07:40:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 07:40:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 07:40:31,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 07:40:31,920 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 07:40:31,921 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 07:40:31,984 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:31,984 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != ~__CS_ret~0 % 256;#res := 0; [2022-07-12 07:40:32,002 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: assume 0 != ~__CS_ret~0 % 256; [2022-07-12 07:40:32,003 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:32,003 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:32,003 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0 != ~__CS_ret~0 % 256; [2022-07-12 07:40:32,003 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume 0 != ~__CS_ret~0 % 256; [2022-07-12 07:40:32,003 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:32,003 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:32,004 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != ~__CS_ret~0 % 256; [2022-07-12 07:40:32,004 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: SUMMARY for call __CS_cs(); srcloc: null [2022-07-12 07:40:32,223 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:32,223 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume 0 != ~__CS_ret~0 % 256;push_#res#1 := 0; [2022-07-12 07:40:32,223 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:32,224 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 0 != ~__CS_ret~0 % 256;pop_#res#1 := 0; [2022-07-12 07:40:32,224 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:32,224 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume 0 != ~__CS_ret~0 % 256;pop_#res#1 := 0; [2022-07-12 07:40:32,224 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:32,224 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##42: assume 0 != ~__CS_ret~0 % 256;pop_#res#1 := 0; [2022-07-12 07:40:32,224 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: assume 0 != ~__CS_ret~0 % 256;pop_#res#1 := 0; [2022-07-12 07:40:32,224 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: assume !(0 != ~__CS_ret~0 % 256);pop_#res#1 := 0; [2022-07-12 07:40:32,225 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-4: SUMMARY for call __CS_cs(); srcloc: null [2022-07-12 07:40:32,225 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume 0 != ~__CS_ret~0 % 256;push_#res#1 := 0; [2022-07-12 07:40:32,225 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:34,466 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 07:40:34,472 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 07:40:34,472 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 07:40:34,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:40:34 BoogieIcfgContainer [2022-07-12 07:40:34,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 07:40:34,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 07:40:34,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 07:40:34,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 07:40:34,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:40:30" (1/3) ... [2022-07-12 07:40:34,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b36a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:40:34, skipping insertion in model container [2022-07-12 07:40:34,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:31" (2/3) ... [2022-07-12 07:40:34,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b36a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:40:34, skipping insertion in model container [2022-07-12 07:40:34,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:40:34" (3/3) ... [2022-07-12 07:40:34,481 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stack-2.i [2022-07-12 07:40:34,491 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 07:40:34,491 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 07:40:34,538 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 07:40:34,548 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@52806047, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@559b6ff9 [2022-07-12 07:40:34,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 07:40:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 136 states have (on average 1.5147058823529411) internal successors, (206), 139 states have internal predecessors, (206), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2022-07-12 07:40:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 07:40:34,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:34,583 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:40:34,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:34,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:34,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1676979695, now seen corresponding path program 1 times [2022-07-12 07:40:34,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:34,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138936881] [2022-07-12 07:40:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 07:40:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 07:40:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 07:40:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 07:40:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 07:40:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 07:40:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 07:40:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 07:40:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 07:40:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 07:40:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 07:40:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 07:40:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 07:40:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 07:40:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-12 07:40:41,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:41,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138936881] [2022-07-12 07:40:41,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138936881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:41,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:40:41,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 07:40:41,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749144414] [2022-07-12 07:40:41,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:41,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 07:40:41,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:41,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 07:40:41,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 07:40:41,510 INFO L87 Difference]: Start difference. First operand has 222 states, 136 states have (on average 1.5147058823529411) internal successors, (206), 139 states have internal predecessors, (206), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 07:40:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:41,603 INFO L93 Difference]: Finished difference Result 440 states and 775 transitions. [2022-07-12 07:40:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 07:40:41,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-07-12 07:40:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:41,612 INFO L225 Difference]: With dead ends: 440 [2022-07-12 07:40:41,613 INFO L226 Difference]: Without dead ends: 218 [2022-07-12 07:40:41,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 07:40:41,642 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:41,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:40:41,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-12 07:40:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-07-12 07:40:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 133 states have (on average 1.4887218045112782) internal successors, (198), 135 states have internal predecessors, (198), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2022-07-12 07:40:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 348 transitions. [2022-07-12 07:40:41,697 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 348 transitions. Word has length 94 [2022-07-12 07:40:41,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:41,698 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 348 transitions. [2022-07-12 07:40:41,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 07:40:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 348 transitions. [2022-07-12 07:40:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 07:40:41,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:41,707 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:40:41,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 07:40:41,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1062498259, now seen corresponding path program 1 times [2022-07-12 07:40:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:41,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560187264] [2022-07-12 07:40:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 07:40:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 07:40:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 07:40:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 07:40:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 07:40:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 07:40:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 07:40:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 07:40:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 07:40:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 07:40:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 07:40:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 07:40:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 07:40:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 07:40:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-12 07:40:53,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:53,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560187264] [2022-07-12 07:40:53,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560187264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:53,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:40:53,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:40:53,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047128689] [2022-07-12 07:40:53,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:53,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:40:53,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:53,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:40:53,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 07:40:53,196 INFO L87 Difference]: Start difference. First operand 218 states and 348 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 07:40:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:53,298 INFO L93 Difference]: Finished difference Result 432 states and 699 transitions. [2022-07-12 07:40:53,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:40:53,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2022-07-12 07:40:53,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:53,303 INFO L225 Difference]: With dead ends: 432 [2022-07-12 07:40:53,306 INFO L226 Difference]: Without dead ends: 398 [2022-07-12 07:40:53,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 07:40:53,307 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 307 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:53,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1225 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:40:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-12 07:40:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2022-07-12 07:40:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 243 states have (on average 1.522633744855967) internal successors, (370), 247 states have internal predecessors, (370), 135 states have call successors, (135), 18 states have call predecessors, (135), 18 states have return successors, (143), 135 states have call predecessors, (143), 135 states have call successors, (143) [2022-07-12 07:40:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 648 transitions. [2022-07-12 07:40:53,371 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 648 transitions. Word has length 94 [2022-07-12 07:40:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:53,372 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 648 transitions. [2022-07-12 07:40:53,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 07:40:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 648 transitions. [2022-07-12 07:40:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 07:40:53,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:53,379 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:40:53,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 07:40:53,379 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:53,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:53,380 INFO L85 PathProgramCache]: Analyzing trace with hash -800885455, now seen corresponding path program 1 times [2022-07-12 07:40:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:53,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827768206] [2022-07-12 07:40:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:53,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 07:41:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 07:41:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 07:41:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 07:41:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 07:41:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 07:41:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 07:41:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 07:41:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 07:41:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 07:41:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 07:41:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 07:41:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 07:41:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 07:41:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 07:41:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 07:41:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 07:41:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 07:41:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 07:41:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 07:41:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2022-07-12 07:41:02,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:02,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827768206] [2022-07-12 07:41:02,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827768206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:41:02,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:41:02,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 07:41:02,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564349957] [2022-07-12 07:41:02,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:41:02,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 07:41:02,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:41:02,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 07:41:02,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-12 07:41:02,769 INFO L87 Difference]: Start difference. First operand 397 states and 648 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-12 07:41:04,783 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:41:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:41:06,314 INFO L93 Difference]: Finished difference Result 1402 states and 2348 transitions. [2022-07-12 07:41:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 07:41:06,314 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) Word has length 183 [2022-07-12 07:41:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:41:06,321 INFO L225 Difference]: With dead ends: 1402 [2022-07-12 07:41:06,321 INFO L226 Difference]: Without dead ends: 1014 [2022-07-12 07:41:06,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-07-12 07:41:06,324 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 708 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 534 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 07:41:06,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1810 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 1265 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 07:41:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2022-07-12 07:41:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 893. [2022-07-12 07:41:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 542 states have (on average 1.529520295202952) internal successors, (829), 559 states have internal predecessors, (829), 307 states have call successors, (307), 36 states have call predecessors, (307), 43 states have return successors, (350), 307 states have call predecessors, (350), 307 states have call successors, (350) [2022-07-12 07:41:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1486 transitions. [2022-07-12 07:41:06,397 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1486 transitions. Word has length 183 [2022-07-12 07:41:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:41:06,398 INFO L495 AbstractCegarLoop]: Abstraction has 893 states and 1486 transitions. [2022-07-12 07:41:06,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-12 07:41:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1486 transitions. [2022-07-12 07:41:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 07:41:06,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:41:06,405 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:41:06,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 07:41:06,405 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:41:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:41:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash -856649123, now seen corresponding path program 1 times [2022-07-12 07:41:06,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:41:06,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863249041] [2022-07-12 07:41:06,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:06,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 07:41:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 07:41:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 07:41:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 07:41:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 07:41:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 07:41:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 07:41:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 07:41:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 07:41:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 07:41:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 07:41:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 07:41:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 07:41:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 07:41:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 07:41:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 07:41:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 07:41:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 07:41:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 07:41:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 07:41:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 07:41:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2022-07-12 07:41:15,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:15,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863249041] [2022-07-12 07:41:15,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863249041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:41:15,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:41:15,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 07:41:15,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321364953] [2022-07-12 07:41:15,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:41:15,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 07:41:15,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:41:15,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 07:41:15,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-12 07:41:15,470 INFO L87 Difference]: Start difference. First operand 893 states and 1486 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-12 07:41:17,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:41:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:41:19,057 INFO L93 Difference]: Finished difference Result 1883 states and 3132 transitions. [2022-07-12 07:41:19,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 07:41:19,058 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) Word has length 183 [2022-07-12 07:41:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:41:19,065 INFO L225 Difference]: With dead ends: 1883 [2022-07-12 07:41:19,065 INFO L226 Difference]: Without dead ends: 959 [2022-07-12 07:41:19,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-07-12 07:41:19,074 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 855 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 452 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 07:41:19,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1531 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 1168 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 07:41:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-12 07:41:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 875. [2022-07-12 07:41:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 532 states have (on average 1.5244360902255638) internal successors, (811), 549 states have internal predecessors, (811), 299 states have call successors, (299), 35 states have call predecessors, (299), 43 states have return successors, (335), 300 states have call predecessors, (335), 299 states have call successors, (335) [2022-07-12 07:41:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1445 transitions. [2022-07-12 07:41:19,129 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1445 transitions. Word has length 183 [2022-07-12 07:41:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:41:19,131 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1445 transitions. [2022-07-12 07:41:19,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-12 07:41:19,131 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1445 transitions. [2022-07-12 07:41:19,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 07:41:19,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:41:19,138 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:41:19,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 07:41:19,138 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:41:19,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:41:19,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1909419641, now seen corresponding path program 1 times [2022-07-12 07:41:19,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:41:19,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325712265] [2022-07-12 07:41:19,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:19,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 07:41:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 07:41:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 07:41:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 07:41:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 07:41:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 07:41:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 07:41:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 07:41:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 07:41:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 07:41:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 07:41:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 07:41:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 07:41:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 07:41:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 07:41:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 07:41:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 07:41:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 07:41:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 07:41:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 07:41:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2022-07-12 07:41:36,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:36,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325712265] [2022-07-12 07:41:36,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325712265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:41:36,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384158459] [2022-07-12 07:41:36,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:36,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:36,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:41:36,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 07:41:36,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 07:41:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:42,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 17177 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 07:41:42,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:41:42,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 07:41:42,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 07:41:42,257 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-12 07:41:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-07-12 07:41:42,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:41:42,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384158459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:41:42,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 07:41:42,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2022-07-12 07:41:42,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4621509] [2022-07-12 07:41:42,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:41:42,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:41:42,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:41:42,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:41:42,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-12 07:41:42,264 INFO L87 Difference]: Start difference. First operand 875 states and 1445 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-12 07:41:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:41:42,382 INFO L93 Difference]: Finished difference Result 1357 states and 2190 transitions. [2022-07-12 07:41:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:41:42,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 183 [2022-07-12 07:41:42,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:41:42,389 INFO L225 Difference]: With dead ends: 1357 [2022-07-12 07:41:42,389 INFO L226 Difference]: Without dead ends: 794 [2022-07-12 07:41:42,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-07-12 07:41:42,393 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 399 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 07:41:42,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1197 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 07:41:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-07-12 07:41:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 692. [2022-07-12 07:41:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 428 states have (on average 1.4789719626168225) internal successors, (633), 441 states have internal predecessors, (633), 220 states have call successors, (220), 35 states have call predecessors, (220), 43 states have return successors, (250), 221 states have call predecessors, (250), 220 states have call successors, (250) [2022-07-12 07:41:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1103 transitions. [2022-07-12 07:41:42,428 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1103 transitions. Word has length 183 [2022-07-12 07:41:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:41:42,428 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1103 transitions. [2022-07-12 07:41:42,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-12 07:41:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1103 transitions. [2022-07-12 07:41:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 07:41:42,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:41:42,434 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:41:42,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 07:41:42,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:42,643 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:41:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:41:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1126606325, now seen corresponding path program 1 times [2022-07-12 07:41:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:41:42,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598831128] [2022-07-12 07:41:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:53,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 07:41:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 07:41:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:41:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 07:41:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 07:41:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 07:41:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 07:41:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 07:41:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 07:41:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 07:41:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 07:41:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 07:41:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 07:41:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 07:41:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 07:41:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 07:41:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 07:41:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 07:41:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 07:41:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 07:41:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 07:41:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 07:41:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2022-07-12 07:41:54,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:54,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598831128] [2022-07-12 07:41:54,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598831128] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:41:54,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041900425] [2022-07-12 07:41:54,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:54,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:54,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:41:54,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 07:41:54,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 07:42:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:00,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 17321 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 07:42:00,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:42:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 349 proven. 6 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2022-07-12 07:42:00,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:42:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2022-07-12 07:42:00,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041900425] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:42:00,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 07:42:00,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 22 [2022-07-12 07:42:00,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163786627] [2022-07-12 07:42:00,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 07:42:00,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 07:42:00,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:42:00,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 07:42:00,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-07-12 07:42:00,590 INFO L87 Difference]: Start difference. First operand 692 states and 1103 transitions. Second operand has 22 states, 22 states have (on average 4.954545454545454) internal successors, (109), 17 states have internal predecessors, (109), 7 states have call successors, (54), 7 states have call predecessors, (54), 10 states have return successors, (55), 10 states have call predecessors, (55), 7 states have call successors, (55) [2022-07-12 07:42:02,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:42:04,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:42:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:42:21,927 INFO L93 Difference]: Finished difference Result 4962 states and 8452 transitions. [2022-07-12 07:42:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2022-07-12 07:42:21,928 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.954545454545454) internal successors, (109), 17 states have internal predecessors, (109), 7 states have call successors, (54), 7 states have call predecessors, (54), 10 states have return successors, (55), 10 states have call predecessors, (55), 7 states have call successors, (55) Word has length 187 [2022-07-12 07:42:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:42:21,951 INFO L225 Difference]: With dead ends: 4962 [2022-07-12 07:42:21,952 INFO L226 Difference]: Without dead ends: 4268 [2022-07-12 07:42:21,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16517 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4644, Invalid=34362, Unknown=0, NotChecked=0, Total=39006 [2022-07-12 07:42:21,967 INFO L413 NwaCegarLoop]: 676 mSDtfsCounter, 6054 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 12065 mSolverCounterSat, 10067 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6075 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 22134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10067 IncrementalHoareTripleChecker+Valid, 12065 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:42:21,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6075 Valid, 3444 Invalid, 22134 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10067 Valid, 12065 Invalid, 2 Unknown, 0 Unchecked, 16.0s Time] [2022-07-12 07:42:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2022-07-12 07:42:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 3652. [2022-07-12 07:42:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 2300 states have (on average 1.2978260869565217) internal successors, (2985), 2242 states have internal predecessors, (2985), 1128 states have call successors, (1128), 137 states have call predecessors, (1128), 223 states have return successors, (1731), 1276 states have call predecessors, (1731), 1128 states have call successors, (1731) [2022-07-12 07:42:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 5844 transitions. [2022-07-12 07:42:22,223 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 5844 transitions. Word has length 187 [2022-07-12 07:42:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:42:22,224 INFO L495 AbstractCegarLoop]: Abstraction has 3652 states and 5844 transitions. [2022-07-12 07:42:22,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.954545454545454) internal successors, (109), 17 states have internal predecessors, (109), 7 states have call successors, (54), 7 states have call predecessors, (54), 10 states have return successors, (55), 10 states have call predecessors, (55), 7 states have call successors, (55) [2022-07-12 07:42:22,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 5844 transitions. [2022-07-12 07:42:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 07:42:22,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:42:22,245 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:42:22,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 07:42:22,467 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,SelfDestructingSolverStorable5 [2022-07-12 07:42:22,467 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:42:22,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:42:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash 734458644, now seen corresponding path program 1 times [2022-07-12 07:42:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:42:22,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861183350] [2022-07-12 07:42:22,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:42:22,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:42:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:42:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 07:42:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 07:42:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:42:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 07:42:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 07:42:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 07:42:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 07:42:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 07:42:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 07:42:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 07:42:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 07:42:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 07:42:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 07:42:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 07:42:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 07:42:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 07:42:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 07:42:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 07:42:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 07:42:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 07:42:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 07:42:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 07:42:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2022-07-12 07:42:33,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:42:33,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861183350] [2022-07-12 07:42:33,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861183350] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:42:33,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056921828] [2022-07-12 07:42:33,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:42:33,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:42:33,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:42:33,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 07:42:33,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 07:42:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:40,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 17390 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 07:42:40,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:42:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 346 proven. 2 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2022-07-12 07:42:40,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:42:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2022-07-12 07:42:41,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056921828] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:42:41,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 07:42:41,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2022-07-12 07:42:41,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265718017] [2022-07-12 07:42:41,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 07:42:41,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 07:42:41,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:42:41,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 07:42:41,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-07-12 07:42:41,291 INFO L87 Difference]: Start difference. First operand 3652 states and 5844 transitions. Second operand has 23 states, 22 states have (on average 5.045454545454546) internal successors, (111), 19 states have internal predecessors, (111), 13 states have call successors, (57), 10 states have call predecessors, (57), 11 states have return successors, (55), 11 states have call predecessors, (55), 13 states have call successors, (55) [2022-07-12 07:42:43,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:42:45,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:42:47,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:42:49,354 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-12 07:42:51,366 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:42:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:42:57,215 INFO L93 Difference]: Finished difference Result 11746 states and 19082 transitions. [2022-07-12 07:42:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 07:42:57,223 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.045454545454546) internal successors, (111), 19 states have internal predecessors, (111), 13 states have call successors, (57), 10 states have call predecessors, (57), 11 states have return successors, (55), 11 states have call predecessors, (55), 13 states have call successors, (55) Word has length 187 [2022-07-12 07:42:57,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:42:57,261 INFO L225 Difference]: With dead ends: 11746 [2022-07-12 07:42:57,261 INFO L226 Difference]: Without dead ends: 8061 [2022-07-12 07:42:57,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=427, Invalid=1735, Unknown=0, NotChecked=0, Total=2162 [2022-07-12 07:42:57,281 INFO L413 NwaCegarLoop]: 774 mSDtfsCounter, 1891 mSDsluCounter, 3279 mSDsCounter, 0 mSdLazyCounter, 6050 mSolverCounterSat, 1785 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 4053 SdHoareTripleChecker+Invalid, 7840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1785 IncrementalHoareTripleChecker+Valid, 6050 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-07-12 07:42:57,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2050 Valid, 4053 Invalid, 7840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1785 Valid, 6050 Invalid, 5 Unknown, 0 Unchecked, 14.9s Time] [2022-07-12 07:42:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8061 states. [2022-07-12 07:42:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8061 to 7241. [2022-07-12 07:42:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7241 states, 4511 states have (on average 1.2977166925293726) internal successors, (5854), 4444 states have internal predecessors, (5854), 2327 states have call successors, (2327), 243 states have call predecessors, (2327), 402 states have return successors, (3539), 2565 states have call predecessors, (3539), 2327 states have call successors, (3539) [2022-07-12 07:42:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 11720 transitions. [2022-07-12 07:42:57,697 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 11720 transitions. Word has length 187 [2022-07-12 07:42:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:42:57,698 INFO L495 AbstractCegarLoop]: Abstraction has 7241 states and 11720 transitions. [2022-07-12 07:42:57,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.045454545454546) internal successors, (111), 19 states have internal predecessors, (111), 13 states have call successors, (57), 10 states have call predecessors, (57), 11 states have return successors, (55), 11 states have call predecessors, (55), 13 states have call successors, (55) [2022-07-12 07:42:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 11720 transitions. [2022-07-12 07:42:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 07:42:57,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:42:57,737 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:42:57,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 07:42:57,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:42:57,951 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:42:57,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:42:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash 916191893, now seen corresponding path program 1 times [2022-07-12 07:42:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:42:57,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817552262] [2022-07-12 07:42:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:42:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms