./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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_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-?-f4b24e3 [2022-07-13 19:20:55,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 19:20:55,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 19:20:55,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 19:20:55,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 19:20:55,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 19:20:55,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 19:20:55,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 19:20:55,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 19:20:55,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 19:20:55,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 19:20:55,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 19:20:55,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 19:20:55,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 19:20:55,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 19:20:55,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 19:20:55,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 19:20:55,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 19:20:55,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 19:20:55,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 19:20:55,871 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 19:20:55,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 19:20:55,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 19:20:55,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 19:20:55,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 19:20:55,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 19:20:55,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 19:20:55,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 19:20:55,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 19:20:55,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 19:20:55,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 19:20:55,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 19:20:55,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 19:20:55,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 19:20:55,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 19:20:55,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 19:20:55,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 19:20:55,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 19:20:55,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 19:20:55,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 19:20:55,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 19:20:55,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 19:20:55,886 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 19:20:55,908 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 19:20:55,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 19:20:55,909 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 19:20:55,909 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 19:20:55,910 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 19:20:55,910 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 19:20:55,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 19:20:55,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 19:20:55,911 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 19:20:55,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 19:20:55,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 19:20:55,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 19:20:55,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 19:20:55,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 19:20:55,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 19:20:55,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 19:20:55,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 19:20:55,913 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 19:20:55,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 19:20:55,914 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 19:20:55,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 19:20:55,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 19:20:55,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 19:20:55,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 19:20:55,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:20:55,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 19:20:55,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 19:20:55,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 19:20:55,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 19:20:55,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 19:20:55,916 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 19:20:55,916 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 19:20:55,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 19:20:55,916 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-13 19:20:56,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 19:20:56,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 19:20:56,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 19:20:56,145 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 19:20:56,146 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 19:20:56,147 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-13 19:20:56,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef0405d7/77594cbe091349709d4fc9045599ee42/FLAGa73f01373 [2022-07-13 19:20:56,659 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 19:20:56,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i [2022-07-13 19:20:56,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef0405d7/77594cbe091349709d4fc9045599ee42/FLAGa73f01373 [2022-07-13 19:20:56,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef0405d7/77594cbe091349709d4fc9045599ee42 [2022-07-13 19:20:56,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 19:20:56,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 19:20:56,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 19:20:56,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 19:20:56,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 19:20:56,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:20:56" (1/1) ... [2022-07-13 19:20:56,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e91477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:56, skipping insertion in model container [2022-07-13 19:20:56,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:20:56" (1/1) ... [2022-07-13 19:20:56,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 19:20:56,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 19:20:57,078 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-13 19:20:57,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:20:57,192 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 19:20:57,225 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-13 19:20:57,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:20:57,291 INFO L208 MainTranslator]: Completed translation [2022-07-13 19:20:57,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:57 WrapperNode [2022-07-13 19:20:57,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 19:20:57,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 19:20:57,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 19:20:57,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 19:20:57,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:57" (1/1) ... [2022-07-13 19:20:57,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:57" (1/1) ... [2022-07-13 19:20:57,368 INFO L137 Inliner]: procedures = 252, calls = 270, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 603 [2022-07-13 19:20:57,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 19:20:57,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 19:20:57,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 19:20:57,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 19:20:57,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:57" (1/1) ... [2022-07-13 19:20:57,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:57" (1/1) ... [2022-07-13 19:20:57,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:57" (1/1) ... [2022-07-13 19:20:57,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:57" (1/1) ... [2022-07-13 19:20:57,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:57" (1/1) ... [2022-07-13 19:20:57,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:57" (1/1) ... [2022-07-13 19:20:57,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:57" (1/1) ... [2022-07-13 19:20:57,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 19:20:57,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 19:20:57,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 19:20:57,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 19:20:57,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:57" (1/1) ... [2022-07-13 19:20:57,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:20:57,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:20:57,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 19:20:57,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 19:20:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 19:20:57,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 19:20:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 19:20:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-13 19:20:57,525 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-13 19:20:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 19:20:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 19:20:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 19:20:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-13 19:20:57,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-13 19:20:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 19:20:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 19:20:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2022-07-13 19:20:57,527 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2022-07-13 19:20:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 19:20:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 19:20:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-13 19:20:57,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-13 19:20:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-13 19:20:57,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-13 19:20:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:20:57,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:20:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-07-13 19:20:57,528 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-07-13 19:20:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-13 19:20:57,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-13 19:20:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 19:20:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 19:20:57,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 19:20:57,671 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 19:20:57,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 19:20:57,731 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:57,731 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != ~__CS_ret~0 % 256;#res := 0; [2022-07-13 19:20:57,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: assume 0 != ~__CS_ret~0 % 256; [2022-07-13 19:20:57,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:57,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:57,758 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0 != ~__CS_ret~0 % 256; [2022-07-13 19:20:57,758 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume 0 != ~__CS_ret~0 % 256; [2022-07-13 19:20:57,758 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:57,758 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:57,759 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != ~__CS_ret~0 % 256; [2022-07-13 19:20:57,759 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: SUMMARY for call __CS_cs(); srcloc: null [2022-07-13 19:20:58,003 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:58,003 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume 0 != ~__CS_ret~0 % 256;push_#res#1 := 0; [2022-07-13 19:20:58,004 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:58,004 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 0 != ~__CS_ret~0 % 256;pop_#res#1 := 0; [2022-07-13 19:20:58,004 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:58,004 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume 0 != ~__CS_ret~0 % 256;pop_#res#1 := 0; [2022-07-13 19:20:58,004 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:58,004 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##42: assume 0 != ~__CS_ret~0 % 256;pop_#res#1 := 0; [2022-07-13 19:20:58,004 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: assume 0 != ~__CS_ret~0 % 256;pop_#res#1 := 0; [2022-07-13 19:20:58,005 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: assume !(0 != ~__CS_ret~0 % 256);pop_#res#1 := 0; [2022-07-13 19:20:58,005 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-4: SUMMARY for call __CS_cs(); srcloc: null [2022-07-13 19:20:58,005 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume 0 != ~__CS_ret~0 % 256;push_#res#1 := 0; [2022-07-13 19:20:58,005 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:21:00,331 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 19:21:00,343 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 19:21:00,343 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 19:21:00,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:21:00 BoogieIcfgContainer [2022-07-13 19:21:00,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 19:21:00,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 19:21:00,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 19:21:00,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 19:21:00,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 07:20:56" (1/3) ... [2022-07-13 19:21:00,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee3b8dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:21:00, skipping insertion in model container [2022-07-13 19:21:00,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:57" (2/3) ... [2022-07-13 19:21:00,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee3b8dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:21:00, skipping insertion in model container [2022-07-13 19:21:00,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:21:00" (3/3) ... [2022-07-13 19:21:00,352 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stack-2.i [2022-07-13 19:21:00,361 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 19:21:00,362 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 19:21:00,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 19:21:00,405 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@1cc53700, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5efe1ed2 [2022-07-13 19:21:00,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 19:21:00,409 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-13 19:21:00,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 19:21:00,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:00,424 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-13 19:21:00,425 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:00,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:00,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1676979695, now seen corresponding path program 1 times [2022-07-13 19:21:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:00,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584459808] [2022-07-13 19:21:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:00,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 19:21:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 19:21:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 19:21:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 19:21:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 19:21:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 19:21:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:07,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 19:21:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 19:21:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:07,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 19:21:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:07,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 19:21:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 19:21:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:07,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 19:21:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 19:21:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:07,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 19:21:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:07,027 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-13 19:21:07,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:07,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584459808] [2022-07-13 19:21:07,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584459808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:07,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:07,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 19:21:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174907635] [2022-07-13 19:21:07,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:07,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 19:21:07,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:07,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 19:21:07,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 19:21:07,052 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-13 19:21:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:07,086 INFO L93 Difference]: Finished difference Result 440 states and 775 transitions. [2022-07-13 19:21:07,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 19:21:07,098 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-13 19:21:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:07,110 INFO L225 Difference]: With dead ends: 440 [2022-07-13 19:21:07,110 INFO L226 Difference]: Without dead ends: 218 [2022-07-13 19:21:07,118 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-13 19:21:07,120 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-13 19:21:07,122 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-13 19:21:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-13 19:21:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-07-13 19:21:07,182 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-13 19:21:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 348 transitions. [2022-07-13 19:21:07,189 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 348 transitions. Word has length 94 [2022-07-13 19:21:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:07,190 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 348 transitions. [2022-07-13 19:21:07,190 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-13 19:21:07,190 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 348 transitions. [2022-07-13 19:21:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 19:21:07,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:07,199 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-13 19:21:07,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 19:21:07,199 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:07,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1062498259, now seen corresponding path program 1 times [2022-07-13 19:21:07,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:07,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704403933] [2022-07-13 19:21:07,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 19:21:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 19:21:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 19:21:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 19:21:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 19:21:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 19:21:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 19:21:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 19:21:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 19:21:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 19:21:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 19:21:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 19:21:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 19:21:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 19:21:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,646 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-13 19:21:18,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:18,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704403933] [2022-07-13 19:21:18,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704403933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:18,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:18,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 19:21:18,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208991944] [2022-07-13 19:21:18,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:18,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 19:21:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:18,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 19:21:18,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 19:21:18,654 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-13 19:21:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:18,724 INFO L93 Difference]: Finished difference Result 432 states and 699 transitions. [2022-07-13 19:21:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 19:21:18,725 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-13 19:21:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:18,731 INFO L225 Difference]: With dead ends: 432 [2022-07-13 19:21:18,732 INFO L226 Difference]: Without dead ends: 398 [2022-07-13 19:21:18,732 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-13 19:21:18,733 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-13 19:21:18,734 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-13 19:21:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-13 19:21:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2022-07-13 19:21:18,773 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-13 19:21:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 648 transitions. [2022-07-13 19:21:18,777 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 648 transitions. Word has length 94 [2022-07-13 19:21:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:18,778 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 648 transitions. [2022-07-13 19:21:18,778 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-13 19:21:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 648 transitions. [2022-07-13 19:21:18,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-13 19:21:18,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:18,787 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-13 19:21:18,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 19:21:18,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:18,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:18,788 INFO L85 PathProgramCache]: Analyzing trace with hash -800885455, now seen corresponding path program 1 times [2022-07-13 19:21:18,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:18,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098529290] [2022-07-13 19:21:18,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:18,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 19:21:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 19:21:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 19:21:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 19:21:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 19:21:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 19:21:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 19:21:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 19:21:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 19:21:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 19:21:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 19:21:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 19:21:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 19:21:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 19:21:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 19:21:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 19:21:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 19:21:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 19:21:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 19:21:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-13 19:21:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 19:21:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,762 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-13 19:21:27,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:27,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098529290] [2022-07-13 19:21:27,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098529290] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:27,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:27,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 19:21:27,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322794668] [2022-07-13 19:21:27,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:27,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 19:21:27,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:27,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 19:21:27,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 19:21:27,768 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-13 19:21:29,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:31,303 INFO L93 Difference]: Finished difference Result 1402 states and 2348 transitions. [2022-07-13 19:21:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 19:21:31,303 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-13 19:21:31,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:31,311 INFO L225 Difference]: With dead ends: 1402 [2022-07-13 19:21:31,311 INFO L226 Difference]: Without dead ends: 1014 [2022-07-13 19:21:31,313 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-13 19:21:31,314 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-13 19:21:31,314 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-13 19:21:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2022-07-13 19:21:31,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 893. [2022-07-13 19:21:31,360 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-13 19:21:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1486 transitions. [2022-07-13 19:21:31,366 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1486 transitions. Word has length 183 [2022-07-13 19:21:31,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:31,366 INFO L495 AbstractCegarLoop]: Abstraction has 893 states and 1486 transitions. [2022-07-13 19:21:31,366 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-13 19:21:31,367 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1486 transitions. [2022-07-13 19:21:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-13 19:21:31,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:31,373 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-13 19:21:31,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 19:21:31,373 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:31,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash -856649123, now seen corresponding path program 1 times [2022-07-13 19:21:31,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:31,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490817423] [2022-07-13 19:21:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 19:21:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 19:21:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 19:21:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 19:21:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 19:21:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 19:21:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 19:21:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 19:21:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 19:21:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 19:21:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 19:21:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 19:21:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 19:21:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 19:21:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 19:21:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 19:21:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 19:21:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 19:21:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 19:21:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-13 19:21:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 19:21:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:40,521 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-13 19:21:40,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:40,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490817423] [2022-07-13 19:21:40,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490817423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:40,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:40,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 19:21:40,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662595825] [2022-07-13 19:21:40,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:40,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 19:21:40,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:40,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 19:21:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 19:21:40,523 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-13 19:21:42,535 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:44,091 INFO L93 Difference]: Finished difference Result 1883 states and 3132 transitions. [2022-07-13 19:21:44,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 19:21:44,092 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-13 19:21:44,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:44,098 INFO L225 Difference]: With dead ends: 1883 [2022-07-13 19:21:44,098 INFO L226 Difference]: Without dead ends: 959 [2022-07-13 19:21:44,104 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-13 19:21:44,106 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-13 19:21:44,108 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-13 19:21:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-13 19:21:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 875. [2022-07-13 19:21:44,147 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-13 19:21:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1445 transitions. [2022-07-13 19:21:44,153 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1445 transitions. Word has length 183 [2022-07-13 19:21:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:44,154 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1445 transitions. [2022-07-13 19:21:44,154 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-13 19:21:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1445 transitions. [2022-07-13 19:21:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-13 19:21:44,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:44,160 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-13 19:21:44,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 19:21:44,160 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1909419641, now seen corresponding path program 1 times [2022-07-13 19:21:44,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:44,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985427191] [2022-07-13 19:21:44,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:44,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 19:21:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 19:21:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 19:21:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 19:21:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 19:21:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 19:21:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 19:21:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 19:21:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 19:21:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 19:21:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 19:21:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 19:21:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 19:21:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 19:21:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 19:21:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 19:21:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 19:21:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 19:21:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-13 19:21:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 19:21:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:59,618 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-13 19:21:59,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:59,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985427191] [2022-07-13 19:21:59,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985427191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:59,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694545470] [2022-07-13 19:21:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:59,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:59,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:59,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:59,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 19:22:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:04,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 17177 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 19:22:04,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:04,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 19:22:04,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 19:22:04,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 19:22:04,838 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-13 19:22:04,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:22:04,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694545470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:22:04,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:22:04,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2022-07-13 19:22:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440993236] [2022-07-13 19:22:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:22:04,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 19:22:04,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:22:04,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 19:22:04,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-13 19:22:04,842 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-13 19:22:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:04,989 INFO L93 Difference]: Finished difference Result 1357 states and 2190 transitions. [2022-07-13 19:22:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 19:22:04,990 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-13 19:22:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:04,995 INFO L225 Difference]: With dead ends: 1357 [2022-07-13 19:22:04,995 INFO L226 Difference]: Without dead ends: 794 [2022-07-13 19:22:04,998 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-13 19:22:04,999 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-13 19:22:05,000 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-13 19:22:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-07-13 19:22:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 692. [2022-07-13 19:22:05,031 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-13 19:22:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1103 transitions. [2022-07-13 19:22:05,035 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1103 transitions. Word has length 183 [2022-07-13 19:22:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:05,035 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1103 transitions. [2022-07-13 19:22:05,036 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-13 19:22:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1103 transitions. [2022-07-13 19:22:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-13 19:22:05,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:05,041 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-13 19:22:05,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:05,263 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-13 19:22:05,263 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1126606325, now seen corresponding path program 1 times [2022-07-13 19:22:05,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:22:05,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905904200] [2022-07-13 19:22:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:05,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:22:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:22:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:22:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 19:22:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:22:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 19:22:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 19:22:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 19:22:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 19:22:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 19:22:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 19:22:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 19:22:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 19:22:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 19:22:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 19:22:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 19:22:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-13 19:22:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-13 19:22:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 19:22:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 19:22:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 19:22:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 19:22:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 19:22:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 19:22:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:15,922 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-13 19:22:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:22:15,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905904200] [2022-07-13 19:22:15,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905904200] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:22:15,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919362055] [2022-07-13 19:22:15,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:15,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:15,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:22:15,924 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:22:15,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 19:22:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:21,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 17321 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 19:22:21,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:22,157 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-13 19:22:22,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:22:22,435 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-13 19:22:22,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919362055] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:22:22,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:22:22,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 22 [2022-07-13 19:22:22,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323072590] [2022-07-13 19:22:22,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:22:22,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 19:22:22,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:22:22,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 19:22:22,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-07-13 19:22:22,436 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-13 19:22:24,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:22:26,488 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:22:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:44,094 INFO L93 Difference]: Finished difference Result 4962 states and 8452 transitions. [2022-07-13 19:22:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2022-07-13 19:22:44,095 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-13 19:22:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:44,118 INFO L225 Difference]: With dead ends: 4962 [2022-07-13 19:22:44,118 INFO L226 Difference]: Without dead ends: 4268 [2022-07-13 19:22:44,133 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-13 19:22:44,134 INFO L413 NwaCegarLoop]: 676 mSDtfsCounter, 6063 mSDsluCounter, 2765 mSDsCounter, 0 mSdLazyCounter, 12065 mSolverCounterSat, 10067 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6084 SdHoareTripleChecker+Valid, 3441 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.3s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:44,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6084 Valid, 3441 Invalid, 22134 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10067 Valid, 12065 Invalid, 2 Unknown, 0 Unchecked, 16.3s Time] [2022-07-13 19:22:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2022-07-13 19:22:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 3652. [2022-07-13 19:22:44,405 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-13 19:22:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 5844 transitions. [2022-07-13 19:22:44,422 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 5844 transitions. Word has length 187 [2022-07-13 19:22:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:44,422 INFO L495 AbstractCegarLoop]: Abstraction has 3652 states and 5844 transitions. [2022-07-13 19:22:44,423 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-13 19:22:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 5844 transitions. [2022-07-13 19:22:44,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-13 19:22:44,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:44,443 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-13 19:22:44,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:44,659 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-13 19:22:44,659 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash 734458644, now seen corresponding path program 1 times [2022-07-13 19:22:44,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:22:44,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137770160] [2022-07-13 19:22:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:44,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:22:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:22:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:22:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 19:22:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:22:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 19:22:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 19:22:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 19:22:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 19:22:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 19:22:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 19:22:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 19:22:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 19:22:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 19:22:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 19:22:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 19:22:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-13 19:22:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-13 19:22:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 19:22:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 19:22:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 19:22:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 19:22:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 19:22:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 19:22:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,536 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-13 19:22:56,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:22:56,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137770160] [2022-07-13 19:22:56,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137770160] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:22:56,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650640295] [2022-07-13 19:22:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:56,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:56,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:22:56,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:22:56,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 19:23:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:03,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 17390 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 19:23:03,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:23:03,431 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-13 19:23:03,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:23:03,781 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-13 19:23:03,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650640295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:23:03,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:23:03,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2022-07-13 19:23:03,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332266090] [2022-07-13 19:23:03,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:23:03,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 19:23:03,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:23:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 19:23:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-07-13 19:23:03,783 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-13 19:23:05,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:23:07,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:23:09,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:23:11,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:23:13,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:23:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:23:19,576 INFO L93 Difference]: Finished difference Result 11746 states and 19082 transitions. [2022-07-13 19:23:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-13 19:23:19,576 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-13 19:23:19,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:23:19,622 INFO L225 Difference]: With dead ends: 11746 [2022-07-13 19:23:19,623 INFO L226 Difference]: Without dead ends: 8061 [2022-07-13 19:23:19,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=427, Invalid=1735, Unknown=0, NotChecked=0, Total=2162 [2022-07-13 19:23:19,648 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-13 19:23:19,648 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-13 19:23:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8061 states. [2022-07-13 19:23:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8061 to 7241. [2022-07-13 19:23:20,109 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-13 19:23:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 11720 transitions. [2022-07-13 19:23:20,142 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 11720 transitions. Word has length 187 [2022-07-13 19:23:20,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:23:20,143 INFO L495 AbstractCegarLoop]: Abstraction has 7241 states and 11720 transitions. [2022-07-13 19:23:20,153 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-13 19:23:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 11720 transitions. [2022-07-13 19:23:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-13 19:23:20,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:23:20,183 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-13 19:23:20,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 19:23:20,411 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-13 19:23:20,412 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:23:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:23:20,412 INFO L85 PathProgramCache]: Analyzing trace with hash 916191893, now seen corresponding path program 1 times [2022-07-13 19:23:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:23:20,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046259040] [2022-07-13 19:23:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:23:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms