./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_szymanski.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_szymanski.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 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 19:21:17,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 19:21:17,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 19:21:17,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 19:21:17,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 19:21:17,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 19:21:17,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 19:21:17,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 19:21:17,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 19:21:17,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 19:21:17,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 19:21:17,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 19:21:17,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 19:21:17,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 19:21:17,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 19:21:17,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 19:21:17,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 19:21:17,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 19:21:17,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 19:21:17,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 19:21:17,252 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 19:21:17,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 19:21:17,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 19:21:17,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 19:21:17,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 19:21:17,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 19:21:17,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 19:21:17,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 19:21:17,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 19:21:17,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 19:21:17,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 19:21:17,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 19:21:17,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 19:21:17,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 19:21:17,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 19:21:17,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 19:21:17,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 19:21:17,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 19:21:17,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 19:21:17,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 19:21:17,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 19:21:17,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 19:21:17,266 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 19:21:17,294 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 19:21:17,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 19:21:17,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 19:21:17,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 19:21:17,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 19:21:17,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 19:21:17,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 19:21:17,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 19:21:17,299 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 19:21:17,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 19:21:17,300 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 19:21:17,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 19:21:17,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 19:21:17,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 19:21:17,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 19:21:17,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 19:21:17,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 19:21:17,301 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 19:21:17,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 19:21:17,301 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 19:21:17,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 19:21:17,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 19:21:17,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 19:21:17,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 19:21:17,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:21:17,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 19:21:17,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 19:21:17,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 19:21:17,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 19:21:17,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 19:21:17,304 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 19:21:17,304 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 19:21:17,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 19:21:17,305 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 -> 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 [2022-07-13 19:21:17,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 19:21:17,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 19:21:17,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 19:21:17,511 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 19:21:17,511 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 19:21:17,512 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_szymanski.i [2022-07-13 19:21:17,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68b3b95f2/2ed00f6739b34e8ba0a77dd10e0cd204/FLAG1cbe6b33b [2022-07-13 19:21:17,985 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 19:21:17,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i [2022-07-13 19:21:18,007 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68b3b95f2/2ed00f6739b34e8ba0a77dd10e0cd204/FLAG1cbe6b33b [2022-07-13 19:21:18,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68b3b95f2/2ed00f6739b34e8ba0a77dd10e0cd204 [2022-07-13 19:21:18,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 19:21:18,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 19:21:18,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 19:21:18,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 19:21:18,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 19:21:18,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608b0488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18, skipping insertion in model container [2022-07-13 19:21:18,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 19:21:18,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 19:21:18,513 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_szymanski.i[23606,23619] [2022-07-13 19:21:18,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:21:18,596 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 19:21:18,617 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_szymanski.i[23606,23619] [2022-07-13 19:21:18,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:21:18,688 INFO L208 MainTranslator]: Completed translation [2022-07-13 19:21:18,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18 WrapperNode [2022-07-13 19:21:18,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 19:21:18,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 19:21:18,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 19:21:18,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 19:21:18,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,772 INFO L137 Inliner]: procedures = 145, calls = 289, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 395 [2022-07-13 19:21:18,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 19:21:18,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 19:21:18,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 19:21:18,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 19:21:18,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 19:21:18,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 19:21:18,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 19:21:18,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 19:21:18,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (1/1) ... [2022-07-13 19:21:18,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:21:18,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:18,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 19:21:18,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 19:21:18,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 19:21:18,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 19:21:18,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 19:21:18,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 19:21:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 19:21:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 19:21:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 19:21:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-13 19:21:18,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-13 19:21:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 19:21:18,911 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-13 19:21:18,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-13 19:21:18,911 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:21:18,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:21:18,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 19:21:18,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 19:21:18,911 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-13 19:21:18,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-13 19:21:18,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 19:21:18,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 19:21:18,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 19:21:19,033 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 19:21:19,034 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 19:21:21,446 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 19:21:21,452 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 19:21:21,462 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 19:21:21,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:21:21 BoogieIcfgContainer [2022-07-13 19:21:21,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 19:21:21,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 19:21:21,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 19:21:21,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 19:21:21,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 07:21:18" (1/3) ... [2022-07-13 19:21:21,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf2dc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:21:21, skipping insertion in model container [2022-07-13 19:21:21,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:18" (2/3) ... [2022-07-13 19:21:21,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf2dc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:21:21, skipping insertion in model container [2022-07-13 19:21:21,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:21:21" (3/3) ... [2022-07-13 19:21:21,472 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_szymanski.i [2022-07-13 19:21:21,482 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 19:21:21,482 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 19:21:21,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 19:21:21,531 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@23b2f276, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d819978 [2022-07-13 19:21:21,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 19:21:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 73 states have internal predecessors, (96), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 19:21:21,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 19:21:21,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:21,546 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:21,547 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:21,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1875977801, now seen corresponding path program 1 times [2022-07-13 19:21:21,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:21,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213808685] [2022-07-13 19:21:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:21,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 19:21:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 19:21:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:21:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:21:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 19:21:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 19:21:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 19:21:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 19:21:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 19:21:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 19:21:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 19:21:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 19:21:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 19:21:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 19:21:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 19:21:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 19:21:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 19:21:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 19:21:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-13 19:21:22,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:22,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213808685] [2022-07-13 19:21:22,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213808685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:22,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:22,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:21:22,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194358565] [2022-07-13 19:21:22,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:22,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:21:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:21:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:22,446 INFO L87 Difference]: Start difference. First operand has 111 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 73 states have internal predecessors, (96), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:21:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:22,521 INFO L93 Difference]: Finished difference Result 224 states and 356 transitions. [2022-07-13 19:21:22,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:21:22,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2022-07-13 19:21:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:22,530 INFO L225 Difference]: With dead ends: 224 [2022-07-13 19:21:22,530 INFO L226 Difference]: Without dead ends: 111 [2022-07-13 19:21:22,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:22,539 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 4 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:22,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 304 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-13 19:21:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2022-07-13 19:21:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 19:21:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2022-07-13 19:21:22,572 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 120 [2022-07-13 19:21:22,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:22,572 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2022-07-13 19:21:22,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:21:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2022-07-13 19:21:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-13 19:21:22,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:22,578 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:22,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 19:21:22,578 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:22,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1912175905, now seen corresponding path program 1 times [2022-07-13 19:21:22,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:22,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790546299] [2022-07-13 19:21:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:22,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 19:21:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:21:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 19:21:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 19:21:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 19:21:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 19:21:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 19:21:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 19:21:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 19:21:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 19:21:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 19:21:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 19:21:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 19:21:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 19:21:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 19:21:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 19:21:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 19:21:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-13 19:21:22,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:22,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790546299] [2022-07-13 19:21:22,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790546299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:22,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:22,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:21:22,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213140332] [2022-07-13 19:21:22,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:22,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:21:22,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:22,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:21:22,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:22,943 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:21:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:22,965 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2022-07-13 19:21:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:21:22,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2022-07-13 19:21:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:22,966 INFO L225 Difference]: With dead ends: 215 [2022-07-13 19:21:22,967 INFO L226 Difference]: Without dead ends: 110 [2022-07-13 19:21:22,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:22,968 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:22,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 297 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-13 19:21:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-07-13 19:21:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 19:21:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2022-07-13 19:21:23,006 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 123 [2022-07-13 19:21:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:23,006 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2022-07-13 19:21:23,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:21:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2022-07-13 19:21:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-13 19:21:23,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:23,009 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:23,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 19:21:23,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:23,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1930143839, now seen corresponding path program 1 times [2022-07-13 19:21:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:23,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964601613] [2022-07-13 19:21:23,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:23,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 19:21:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 19:21:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:21:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 19:21:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 19:21:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 19:21:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 19:21:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 19:21:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 19:21:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 19:21:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 19:21:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 19:21:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 19:21:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 19:21:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 19:21:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 19:21:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 19:21:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 19:21:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-13 19:21:23,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:23,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964601613] [2022-07-13 19:21:23,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964601613] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:23,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291085574] [2022-07-13 19:21:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:23,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:23,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:23,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:23,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 19:21:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:24,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 4528 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 19:21:24,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-13 19:21:24,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-13 19:21:24,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291085574] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:24,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:24,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-13 19:21:24,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914604005] [2022-07-13 19:21:24,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:24,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 19:21:24,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:24,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 19:21:24,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:21:24,742 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-13 19:21:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:24,787 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2022-07-13 19:21:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 19:21:24,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 125 [2022-07-13 19:21:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:24,789 INFO L225 Difference]: With dead ends: 219 [2022-07-13 19:21:24,789 INFO L226 Difference]: Without dead ends: 113 [2022-07-13 19:21:24,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:21:24,790 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 3 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:24,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 297 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:24,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-13 19:21:24,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-07-13 19:21:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 19:21:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2022-07-13 19:21:24,807 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 125 [2022-07-13 19:21:24,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:24,807 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2022-07-13 19:21:24,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-13 19:21:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2022-07-13 19:21:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 19:21:24,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:24,809 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:24,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:25,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:25,033 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:25,034 INFO L85 PathProgramCache]: Analyzing trace with hash -28203099, now seen corresponding path program 2 times [2022-07-13 19:21:25,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:25,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033799028] [2022-07-13 19:21:25,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:25,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:21:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 19:21:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 19:21:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 19:21:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 19:21:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 19:21:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 19:21:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 19:21:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 19:21:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 19:21:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 19:21:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 19:21:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 19:21:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 19:21:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 19:21:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 19:21:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 19:21:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2022-07-13 19:21:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:25,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033799028] [2022-07-13 19:21:25,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033799028] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:25,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379477661] [2022-07-13 19:21:25,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 19:21:25,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:25,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:25,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:25,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 19:21:27,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 19:21:27,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 19:21:27,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 4196 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 19:21:27,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2022-07-13 19:21:27,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:21:27,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379477661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:27,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:21:27,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 19:21:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689961837] [2022-07-13 19:21:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:27,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 19:21:27,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:27,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 19:21:27,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:21:27,373 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:21:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:27,406 INFO L93 Difference]: Finished difference Result 211 states and 302 transitions. [2022-07-13 19:21:27,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 19:21:27,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2022-07-13 19:21:27,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:27,409 INFO L225 Difference]: With dead ends: 211 [2022-07-13 19:21:27,409 INFO L226 Difference]: Without dead ends: 169 [2022-07-13 19:21:27,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:21:27,410 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 77 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:27,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 528 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-13 19:21:27,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-13 19:21:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2022-07-13 19:21:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 240 transitions. [2022-07-13 19:21:27,428 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 240 transitions. Word has length 129 [2022-07-13 19:21:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:27,429 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 240 transitions. [2022-07-13 19:21:27,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:21:27,429 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 240 transitions. [2022-07-13 19:21:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-13 19:21:27,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:27,431 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:27,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 19:21:27,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 19:21:27,643 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:27,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:27,643 INFO L85 PathProgramCache]: Analyzing trace with hash -993819535, now seen corresponding path program 1 times [2022-07-13 19:21:27,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:27,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842679600] [2022-07-13 19:21:27,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 19:21:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:27,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 19:21:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 19:21:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 19:21:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 19:21:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 19:21:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 19:21:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 19:21:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 19:21:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 19:21:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 19:21:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 19:21:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 19:21:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 19:21:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 19:21:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 19:21:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 19:21:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 19:21:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 19:21:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 19:21:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-13 19:21:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-13 19:21:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-13 19:21:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-13 19:21:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-13 19:21:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-07-13 19:21:28,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:28,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842679600] [2022-07-13 19:21:28,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842679600] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:28,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293014943] [2022-07-13 19:21:28,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:28,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:28,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:28,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:28,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 19:21:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:29,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 4997 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 19:21:29,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-07-13 19:21:29,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-07-13 19:21:29,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293014943] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:29,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:29,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-07-13 19:21:29,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252028814] [2022-07-13 19:21:29,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:29,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 19:21:29,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:29,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 19:21:29,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-13 19:21:29,739 INFO L87 Difference]: Start difference. First operand 169 states and 240 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (62), 6 states have call predecessors, (62), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2022-07-13 19:21:31,786 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:33,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:34,202 INFO L93 Difference]: Finished difference Result 354 states and 502 transitions. [2022-07-13 19:21:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 19:21:34,203 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (62), 6 states have call predecessors, (62), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 206 [2022-07-13 19:21:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:34,206 INFO L225 Difference]: With dead ends: 354 [2022-07-13 19:21:34,206 INFO L226 Difference]: Without dead ends: 197 [2022-07-13 19:21:34,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 467 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-13 19:21:34,211 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 79 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 139 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:34,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 351 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 268 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-07-13 19:21:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-13 19:21:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2022-07-13 19:21:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 136 states have internal predecessors, (169), 45 states have call successors, (45), 10 states have call predecessors, (45), 12 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2022-07-13 19:21:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 267 transitions. [2022-07-13 19:21:34,239 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 267 transitions. Word has length 206 [2022-07-13 19:21:34,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:34,240 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 267 transitions. [2022-07-13 19:21:34,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (62), 6 states have call predecessors, (62), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2022-07-13 19:21:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 267 transitions. [2022-07-13 19:21:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-13 19:21:34,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:34,244 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:34,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:34,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:34,463 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1193364367, now seen corresponding path program 2 times [2022-07-13 19:21:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:34,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030552987] [2022-07-13 19:21:34,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 19:21:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 19:21:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 19:21:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 19:21:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 19:21:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 19:21:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 19:21:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 19:21:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 19:21:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 19:21:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 19:21:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 19:21:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 19:21:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 19:21:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 19:21:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 19:21:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 19:21:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-13 19:21:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-13 19:21:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-13 19:21:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-13 19:21:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-13 19:21:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-13 19:21:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-13 19:21:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-13 19:21:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2022-07-13 19:21:35,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:35,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030552987] [2022-07-13 19:21:35,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030552987] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:35,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889936539] [2022-07-13 19:21:35,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 19:21:35,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:35,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:35,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:35,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 19:21:37,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 19:21:37,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 19:21:37,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 4282 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 19:21:37,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2022-07-13 19:21:37,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:21:37,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889936539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:37,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:21:37,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-13 19:21:37,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003233896] [2022-07-13 19:21:37,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:37,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:21:37,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:37,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:21:37,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-13 19:21:37,676 INFO L87 Difference]: Start difference. First operand 192 states and 267 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-13 19:21:37,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:37,687 INFO L93 Difference]: Finished difference Result 344 states and 482 transitions. [2022-07-13 19:21:37,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:21:37,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 224 [2022-07-13 19:21:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:37,690 INFO L225 Difference]: With dead ends: 344 [2022-07-13 19:21:37,690 INFO L226 Difference]: Without dead ends: 192 [2022-07-13 19:21:37,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-13 19:21:37,691 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:37,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-13 19:21:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-07-13 19:21:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 136 states have internal predecessors, (168), 45 states have call successors, (45), 10 states have call predecessors, (45), 12 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2022-07-13 19:21:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 266 transitions. [2022-07-13 19:21:37,744 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 266 transitions. Word has length 224 [2022-07-13 19:21:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:37,744 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 266 transitions. [2022-07-13 19:21:37,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-13 19:21:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 266 transitions. [2022-07-13 19:21:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-13 19:21:37,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:37,748 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:37,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:37,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:37,976 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:37,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1496592282, now seen corresponding path program 1 times [2022-07-13 19:21:37,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:37,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303105820] [2022-07-13 19:21:37,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:37,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 19:21:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 19:21:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 19:21:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 19:21:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 19:21:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 19:21:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 19:21:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 19:21:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 19:21:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 19:21:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-13 19:21:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 19:21:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 19:21:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-13 19:21:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-13 19:21:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 19:21:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 19:21:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 19:21:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-13 19:21:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-13 19:21:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-13 19:21:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-13 19:21:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-13 19:21:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-13 19:21:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-13 19:21:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-13 19:21:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1197 trivial. 0 not checked. [2022-07-13 19:21:39,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:39,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303105820] [2022-07-13 19:21:39,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303105820] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:39,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142388791] [2022-07-13 19:21:39,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:39,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:39,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:39,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:39,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 19:21:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:41,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 5430 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 19:21:41,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 374 proven. 21 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2022-07-13 19:21:41,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 1167 trivial. 0 not checked. [2022-07-13 19:21:41,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142388791] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:41,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:41,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 26 [2022-07-13 19:21:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203836797] [2022-07-13 19:21:41,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:41,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 19:21:41,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:41,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 19:21:41,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-07-13 19:21:41,815 INFO L87 Difference]: Start difference. First operand 192 states and 266 transitions. Second operand has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 21 states have internal predecessors, (118), 15 states have call successors, (62), 12 states have call predecessors, (62), 12 states have return successors, (61), 15 states have call predecessors, (61), 15 states have call successors, (61) [2022-07-13 19:21:43,844 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:45,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:47,876 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:21:49,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:54,906 INFO L93 Difference]: Finished difference Result 1037 states and 1615 transitions. [2022-07-13 19:21:54,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-07-13 19:21:54,906 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 21 states have internal predecessors, (118), 15 states have call successors, (62), 12 states have call predecessors, (62), 12 states have return successors, (61), 15 states have call predecessors, (61), 15 states have call successors, (61) Word has length 244 [2022-07-13 19:21:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:54,911 INFO L225 Difference]: With dead ends: 1037 [2022-07-13 19:21:54,948 INFO L226 Difference]: Without dead ends: 878 [2022-07-13 19:21:54,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 568 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3902 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1769, Invalid=9787, Unknown=0, NotChecked=0, Total=11556 [2022-07-13 19:21:54,951 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 1102 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 2629 mSolverCounterSat, 1403 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 4036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1403 IncrementalHoareTripleChecker+Valid, 2629 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:54,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 1094 Invalid, 4036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1403 Valid, 2629 Invalid, 4 Unknown, 0 Unchecked, 10.6s Time] [2022-07-13 19:21:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-07-13 19:21:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 547. [2022-07-13 19:21:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 376 states have (on average 1.25) internal successors, (470), 381 states have internal predecessors, (470), 108 states have call successors, (108), 50 states have call predecessors, (108), 62 states have return successors, (178), 115 states have call predecessors, (178), 108 states have call successors, (178) [2022-07-13 19:21:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 756 transitions. [2022-07-13 19:21:55,007 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 756 transitions. Word has length 244 [2022-07-13 19:21:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:55,008 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 756 transitions. [2022-07-13 19:21:55,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 21 states have internal predecessors, (118), 15 states have call successors, (62), 12 states have call predecessors, (62), 12 states have return successors, (61), 15 states have call predecessors, (61), 15 states have call successors, (61) [2022-07-13 19:21:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 756 transitions. [2022-07-13 19:21:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-13 19:21:55,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:55,012 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:55,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 19:21:55,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:55,219 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1922354694, now seen corresponding path program 1 times [2022-07-13 19:21:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:55,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253582462] [2022-07-13 19:21:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:55,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:22:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 19:22:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 19:22:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 19:22:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 19:22:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 19:22:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 19:22:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 19:22:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 19:22:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:22:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 19:22:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 19:22:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-13 19:22:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 19:22:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 19:22:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-13 19:22:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-13 19:22:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 19:22:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 19:22:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 19:22:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-13 19:22:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-13 19:22:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-13 19:22:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-13 19:22:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-13 19:22:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-13 19:22:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-13 19:22:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-13 19:22:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2022-07-13 19:22:14,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:22:14,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253582462] [2022-07-13 19:22:14,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253582462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:22:14,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097237828] [2022-07-13 19:22:14,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:14,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:14,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:22:14,922 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:22:14,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 19:22:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:17,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 5576 conjuncts, 133 conjunts are in the unsatisfiable core [2022-07-13 19:22:17,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:18,169 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 10 treesize of output 8 [2022-07-13 19:22:18,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:18,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:19,004 INFO L356 Elim1Store]: treesize reduction 156, result has 41.1 percent of original size [2022-07-13 19:22:19,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 442 treesize of output 597 [2022-07-13 19:22:19,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 19:22:19,080 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 8 treesize of output 7 [2022-07-13 19:22:19,108 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 8 treesize of output 7 [2022-07-13 19:22:19,126 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 8 treesize of output 7 [2022-07-13 19:22:22,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:22,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:22,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 38 [2022-07-13 19:22:22,542 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:22,548 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:22,554 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:22,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:22,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 19:22:22,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 34 [2022-07-13 19:22:22,587 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:22,593 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:22,599 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:22,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:22,643 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-13 19:22:22,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 111 [2022-07-13 19:22:22,664 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:26,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:26,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:26,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:26,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:26,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:26,805 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 19:22:26,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 569 treesize of output 569 [2022-07-13 19:22:26,823 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 7 treesize of output 5 [2022-07-13 19:22:26,835 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 7 treesize of output 5 [2022-07-13 19:22:26,846 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 7 treesize of output 5 [2022-07-13 19:22:26,967 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 7 treesize of output 5 [2022-07-13 19:22:26,977 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 7 treesize of output 5 [2022-07-13 19:22:26,993 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 7 treesize of output 5 [2022-07-13 19:22:26,999 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 7 treesize of output 5 [2022-07-13 19:22:27,015 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 7 treesize of output 5 [2022-07-13 19:22:27,100 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 7 treesize of output 5 [2022-07-13 19:22:27,105 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 7 treesize of output 5 [2022-07-13 19:22:27,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:27,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:27,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:27,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:27,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:27,635 INFO L356 Elim1Store]: treesize reduction 74, result has 32.1 percent of original size [2022-07-13 19:22:27,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 864 treesize of output 834 [2022-07-13 19:22:27,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:27,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:27,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 19:22:27,867 INFO L356 Elim1Store]: treesize reduction 146, result has 43.8 percent of original size [2022-07-13 19:22:27,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 788 treesize of output 863 [2022-07-13 19:22:27,901 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 19:22:27,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:28,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:22:28,106 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 19:22:28,109 INFO L158 Benchmark]: Toolchain (without parser) took 69797.03ms. Allocated memory was 90.2MB in the beginning and 843.1MB in the end (delta: 752.9MB). Free memory was 66.2MB in the beginning and 523.9MB in the end (delta: -457.7MB). Peak memory consumption was 646.0MB. Max. memory is 16.1GB. [2022-07-13 19:22:28,109 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 90.2MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 19:22:28,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.18ms. Allocated memory is still 90.2MB. Free memory was 66.0MB in the beginning and 40.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-13 19:22:28,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.47ms. Allocated memory was 90.2MB in the beginning and 117.4MB in the end (delta: 27.3MB). Free memory was 40.2MB in the beginning and 91.8MB in the end (delta: -51.6MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-07-13 19:22:28,110 INFO L158 Benchmark]: Boogie Preprocessor took 57.91ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 91.4MB in the end (delta: 392.7kB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-07-13 19:22:28,110 INFO L158 Benchmark]: RCFGBuilder took 2632.77ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 47.9MB in the end (delta: 43.5MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2022-07-13 19:22:28,110 INFO L158 Benchmark]: TraceAbstraction took 66643.62ms. Allocated memory was 117.4MB in the beginning and 843.1MB in the end (delta: 725.6MB). Free memory was 47.1MB in the beginning and 523.9MB in the end (delta: -476.8MB). Peak memory consumption was 599.8MB. Max. memory is 16.1GB. [2022-07-13 19:22:28,111 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 90.2MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.18ms. Allocated memory is still 90.2MB. Free memory was 66.0MB in the beginning and 40.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.47ms. Allocated memory was 90.2MB in the beginning and 117.4MB in the end (delta: 27.3MB). Free memory was 40.2MB in the beginning and 91.8MB in the end (delta: -51.6MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.91ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 91.4MB in the end (delta: 392.7kB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * RCFGBuilder took 2632.77ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 47.9MB in the end (delta: 43.5MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * TraceAbstraction took 66643.62ms. Allocated memory was 117.4MB in the beginning and 843.1MB in the end (delta: 725.6MB). Free memory was 47.1MB in the beginning and 523.9MB in the end (delta: -476.8MB). Peak memory consumption was 599.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 19:22:28,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_szymanski.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 19:22:29,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 19:22:29,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 19:22:29,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 19:22:29,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 19:22:29,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 19:22:29,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 19:22:29,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 19:22:29,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 19:22:29,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 19:22:29,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 19:22:29,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 19:22:29,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 19:22:29,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 19:22:29,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 19:22:29,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 19:22:29,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 19:22:29,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 19:22:29,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 19:22:29,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 19:22:29,737 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 19:22:29,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 19:22:29,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 19:22:29,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 19:22:29,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 19:22:29,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 19:22:29,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 19:22:29,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 19:22:29,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 19:22:29,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 19:22:29,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 19:22:29,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 19:22:29,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 19:22:29,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 19:22:29,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 19:22:29,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 19:22:29,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 19:22:29,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 19:22:29,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 19:22:29,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 19:22:29,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 19:22:29,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 19:22:29,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 19:22:29,782 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 19:22:29,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 19:22:29,783 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 19:22:29,783 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 19:22:29,783 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 19:22:29,783 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 19:22:29,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 19:22:29,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 19:22:29,784 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 19:22:29,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 19:22:29,785 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 19:22:29,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 19:22:29,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 19:22:29,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 19:22:29,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 19:22:29,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 19:22:29,786 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 19:22:29,786 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 19:22:29,786 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 19:22:29,786 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 19:22:29,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 19:22:29,787 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 19:22:29,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 19:22:29,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 19:22:29,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 19:22:29,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 19:22:29,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:22:29,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 19:22:29,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 19:22:29,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 19:22:29,788 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 19:22:29,788 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 19:22:29,788 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 19:22:29,789 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 19:22:29,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 19:22:29,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 19:22:29,789 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 [2022-07-13 19:22:30,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 19:22:30,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 19:22:30,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 19:22:30,019 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 19:22:30,020 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 19:22:30,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_szymanski.i [2022-07-13 19:22:30,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71f2eeac/2533d7c0a38b44ea9de8049fc79548fd/FLAG0848b7fd7 [2022-07-13 19:22:30,476 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 19:22:30,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i [2022-07-13 19:22:30,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71f2eeac/2533d7c0a38b44ea9de8049fc79548fd/FLAG0848b7fd7 [2022-07-13 19:22:30,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71f2eeac/2533d7c0a38b44ea9de8049fc79548fd [2022-07-13 19:22:30,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 19:22:30,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 19:22:30,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 19:22:30,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 19:22:30,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 19:22:30,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:22:30" (1/1) ... [2022-07-13 19:22:30,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab9f425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:22:30, skipping insertion in model container [2022-07-13 19:22:30,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:22:30" (1/1) ... [2022-07-13 19:22:30,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 19:22:30,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 19:22:31,073 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_szymanski.i[23606,23619] [2022-07-13 19:22:31,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:22:31,195 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 19:22:31,210 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_szymanski.i[23606,23619] [2022-07-13 19:22:31,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:22:31,293 INFO L208 MainTranslator]: Completed translation [2022-07-13 19:22:31,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:22:31 WrapperNode [2022-07-13 19:22:31,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 19:22:31,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 19:22:31,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 19:22:31,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 19:22:31,300 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:22:31" (1/1) ... [2022-07-13 19:22:31,334 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:22:31" (1/1) ... [2022-07-13 19:22:31,362 INFO L137 Inliner]: procedures = 149, calls = 289, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 389 [2022-07-13 19:22:31,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 19:22:31,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 19:22:31,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 19:22:31,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 19:22:31,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:22:31" (1/1) ... [2022-07-13 19:22:31,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:22:31" (1/1) ... [2022-07-13 19:22:31,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:22:31" (1/1) ... [2022-07-13 19:22:31,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:22:31" (1/1) ... [2022-07-13 19:22:31,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:22:31" (1/1) ... [2022-07-13 19:22:31,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:22:31" (1/1) ... [2022-07-13 19:22:31,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:22:31" (1/1) ... [2022-07-13 19:22:31,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 19:22:31,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 19:22:31,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 19:22:31,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 19:22:31,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:22:31" (1/1) ... [2022-07-13 19:22:31,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:22:31,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:22:31,448 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:22:31,449 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:22:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-13 19:22:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 19:22:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 19:22:31,469 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 19:22:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 19:22:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 19:22:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 19:22:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-13 19:22:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-13 19:22:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 19:22:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-13 19:22:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-13 19:22:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:22:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:22:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-13 19:22:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 19:22:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 19:22:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 19:22:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 19:22:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-13 19:22:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-13 19:22:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-13 19:22:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 19:22:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 19:22:31,575 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 19:22:31,576 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 19:22:34,243 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 19:22:34,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 19:22:34,254 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 19:22:34,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:22:34 BoogieIcfgContainer [2022-07-13 19:22:34,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 19:22:34,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 19:22:34,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 19:22:34,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 19:22:34,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 07:22:30" (1/3) ... [2022-07-13 19:22:34,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ceb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:22:34, skipping insertion in model container [2022-07-13 19:22:34,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:22:31" (2/3) ... [2022-07-13 19:22:34,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ceb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:22:34, skipping insertion in model container [2022-07-13 19:22:34,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:22:34" (3/3) ... [2022-07-13 19:22:34,267 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_szymanski.i [2022-07-13 19:22:34,275 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 19:22:34,276 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 19:22:34,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 19:22:34,323 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@559bd7d5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62edd8c0 [2022-07-13 19:22:34,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 19:22:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 73 states have internal predecessors, (96), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 19:22:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 19:22:34,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:34,345 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:34,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1875977801, now seen corresponding path program 1 times [2022-07-13 19:22:34,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 19:22:34,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287589513] [2022-07-13 19:22:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:34,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 19:22:34,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 19:22:34,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 19:22:34,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 19:22:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:36,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 2760 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 19:22:36,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2022-07-13 19:22:36,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:22:36,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 19:22:36,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287589513] [2022-07-13 19:22:36,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287589513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:22:36,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:22:36,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 19:22:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546042855] [2022-07-13 19:22:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:22:36,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 19:22:36,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 19:22:36,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 19:22:36,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 19:22:36,392 INFO L87 Difference]: Start difference. First operand has 111 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 73 states have internal predecessors, (96), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-13 19:22:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:36,414 INFO L93 Difference]: Finished difference Result 220 states and 348 transitions. [2022-07-13 19:22:36,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 19:22:36,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-07-13 19:22:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:36,421 INFO L225 Difference]: With dead ends: 220 [2022-07-13 19:22:36,421 INFO L226 Difference]: Without dead ends: 107 [2022-07-13 19:22:36,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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:22:36,426 INFO L413 NwaCegarLoop]: 156 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, 156 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:22:36,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:22:36,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-13 19:22:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-13 19:22:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 69 states have internal predecessors, (88), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 19:22:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2022-07-13 19:22:36,458 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 120 [2022-07-13 19:22:36,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:36,458 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2022-07-13 19:22:36,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-13 19:22:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2022-07-13 19:22:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 19:22:36,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:36,461 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 19:22:36,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 19:22:36,667 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:36,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1758045659, now seen corresponding path program 1 times [2022-07-13 19:22:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 19:22:36,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058772353] [2022-07-13 19:22:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:36,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 19:22:36,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 19:22:36,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 19:22:36,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 19:22:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:38,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 2760 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 19:22:38,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-13 19:22:38,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:22:38,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 19:22:38,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058772353] [2022-07-13 19:22:38,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058772353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:22:38,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:22:38,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:22:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518111789] [2022-07-13 19:22:38,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:22:38,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:22:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 19:22:38,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:22:38,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:22:38,775 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:22:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:38,906 INFO L93 Difference]: Finished difference Result 212 states and 302 transitions. [2022-07-13 19:22:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:22:38,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2022-07-13 19:22:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:38,911 INFO L225 Difference]: With dead ends: 212 [2022-07-13 19:22:38,911 INFO L226 Difference]: Without dead ends: 111 [2022-07-13 19:22:38,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:22:38,913 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 4 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:38,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 296 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 19:22:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-13 19:22:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2022-07-13 19:22:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 19:22:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2022-07-13 19:22:38,925 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 120 [2022-07-13 19:22:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:38,926 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2022-07-13 19:22:38,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:22:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2022-07-13 19:22:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-13 19:22:38,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:38,928 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-13 19:22:39,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 19:22:39,143 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:39,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1912175905, now seen corresponding path program 1 times [2022-07-13 19:22:39,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 19:22:39,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050727982] [2022-07-13 19:22:39,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:39,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 19:22:39,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 19:22:39,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 19:22:39,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 19:22:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:41,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 2797 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 19:22:41,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-13 19:22:41,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:22:41,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 19:22:41,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050727982] [2022-07-13 19:22:41,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050727982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:22:41,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:22:41,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:22:41,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478876207] [2022-07-13 19:22:41,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:22:41,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:22:41,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 19:22:41,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:22:41,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:22:41,277 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:22:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:41,347 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2022-07-13 19:22:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:22:41,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2022-07-13 19:22:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:41,349 INFO L225 Difference]: With dead ends: 215 [2022-07-13 19:22:41,349 INFO L226 Difference]: Without dead ends: 110 [2022-07-13 19:22:41,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:22:41,351 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:41,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 297 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 19:22:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-13 19:22:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-07-13 19:22:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 19:22:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2022-07-13 19:22:41,361 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 123 [2022-07-13 19:22:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:41,361 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2022-07-13 19:22:41,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:22:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2022-07-13 19:22:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-13 19:22:41,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:41,363 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:22:41,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-13 19:22:41,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 19:22:41,568 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:41,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:41,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1930143839, now seen corresponding path program 1 times [2022-07-13 19:22:41,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 19:22:41,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837161687] [2022-07-13 19:22:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:41,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 19:22:41,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 19:22:41,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 19:22:41,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 19:22:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:43,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 2818 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 19:22:43,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-13 19:22:43,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:22:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-13 19:22:43,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 19:22:43,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837161687] [2022-07-13 19:22:43,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837161687] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:22:43,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 19:22:43,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-13 19:22:43,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795323953] [2022-07-13 19:22:43,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 19:22:43,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 19:22:43,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 19:22:43,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 19:22:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:22:43,924 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-13 19:22:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:44,131 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2022-07-13 19:22:44,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 19:22:44,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 125 [2022-07-13 19:22:44,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:44,133 INFO L225 Difference]: With dead ends: 219 [2022-07-13 19:22:44,133 INFO L226 Difference]: Without dead ends: 113 [2022-07-13 19:22:44,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:22:44,135 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 3 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:44,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 738 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 19:22:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-13 19:22:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-07-13 19:22:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 19:22:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2022-07-13 19:22:44,144 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 125 [2022-07-13 19:22:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:44,144 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2022-07-13 19:22:44,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-13 19:22:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2022-07-13 19:22:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 19:22:44,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:44,146 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-13 19:22:44,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 19:22:44,355 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:44,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:44,356 INFO L85 PathProgramCache]: Analyzing trace with hash -28203099, now seen corresponding path program 2 times [2022-07-13 19:22:44,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 19:22:44,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917726951] [2022-07-13 19:22:44,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 19:22:44,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 19:22:44,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 19:22:44,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 19:22:44,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 19:22:46,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 19:22:46,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 19:22:46,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 2595 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 19:22:46,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2022-07-13 19:22:46,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:22:46,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 19:22:46,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917726951] [2022-07-13 19:22:46,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917726951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:22:46,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:22:46,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:22:46,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030785004] [2022-07-13 19:22:46,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:22:46,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:22:46,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 19:22:46,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:22:46,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:22:46,621 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:22:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:46,643 INFO L93 Difference]: Finished difference Result 209 states and 294 transitions. [2022-07-13 19:22:46,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:22:46,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2022-07-13 19:22:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:46,646 INFO L225 Difference]: With dead ends: 209 [2022-07-13 19:22:46,646 INFO L226 Difference]: Without dead ends: 113 [2022-07-13 19:22:46,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:22:46,650 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:46,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:22:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-13 19:22:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-07-13 19:22:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 19:22:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2022-07-13 19:22:46,664 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 129 [2022-07-13 19:22:46,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:46,664 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2022-07-13 19:22:46,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:22:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2022-07-13 19:22:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-13 19:22:46,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:46,666 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:46,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 19:22:46,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:46,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:46,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1960175216, now seen corresponding path program 1 times [2022-07-13 19:22:46,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 19:22:46,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082666072] [2022-07-13 19:22:46,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:46,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 19:22:46,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 19:22:46,882 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 19:22:46,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 19:22:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:49,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 2952 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 19:22:49,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2022-07-13 19:22:49,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:22:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2022-07-13 19:22:49,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 19:22:49,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082666072] [2022-07-13 19:22:49,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082666072] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:22:49,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 19:22:49,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-13 19:22:49,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225301242] [2022-07-13 19:22:49,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 19:22:49,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 19:22:49,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 19:22:49,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 19:22:49,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:22:49,286 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-13 19:22:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:49,580 INFO L93 Difference]: Finished difference Result 232 states and 322 transitions. [2022-07-13 19:22:49,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 19:22:49,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 149 [2022-07-13 19:22:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:49,582 INFO L225 Difference]: With dead ends: 232 [2022-07-13 19:22:49,582 INFO L226 Difference]: Without dead ends: 131 [2022-07-13 19:22:49,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:22:49,583 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:49,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 444 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 19:22:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-13 19:22:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-13 19:22:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 93 states have internal predecessors, (113), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 19:22:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 177 transitions. [2022-07-13 19:22:49,590 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 177 transitions. Word has length 149 [2022-07-13 19:22:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:49,590 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 177 transitions. [2022-07-13 19:22:49,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-13 19:22:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 177 transitions. [2022-07-13 19:22:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-13 19:22:49,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:49,592 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:49,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 19:22:49,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:49,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:49,808 INFO L85 PathProgramCache]: Analyzing trace with hash -375854704, now seen corresponding path program 2 times [2022-07-13 19:22:49,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 19:22:49,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936152433] [2022-07-13 19:22:49,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 19:22:49,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 19:22:49,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 19:22:49,812 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 19:22:49,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 19:22:51,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 19:22:51,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 19:22:52,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 19:22:52,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2022-07-13 19:22:52,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:22:52,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 19:22:52,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936152433] [2022-07-13 19:22:52,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936152433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:22:52,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:22:52,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 19:22:52,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846733969] [2022-07-13 19:22:52,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:22:52,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 19:22:52,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 19:22:52,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 19:22:52,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 19:22:52,416 INFO L87 Difference]: Start difference. First operand 131 states and 177 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-13 19:22:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:53,034 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2022-07-13 19:22:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 19:22:53,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 167 [2022-07-13 19:22:53,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:53,037 INFO L225 Difference]: With dead ends: 241 [2022-07-13 19:22:53,037 INFO L226 Difference]: Without dead ends: 199 [2022-07-13 19:22:53,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:22:53,038 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 119 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:53,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 428 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 19:22:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-13 19:22:53,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-07-13 19:22:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 139 states have internal predecessors, (174), 48 states have call successors, (48), 10 states have call predecessors, (48), 12 states have return successors, (57), 49 states have call predecessors, (57), 48 states have call successors, (57) [2022-07-13 19:22:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 279 transitions. [2022-07-13 19:22:53,051 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 279 transitions. Word has length 167 [2022-07-13 19:22:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:53,051 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 279 transitions. [2022-07-13 19:22:53,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-13 19:22:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 279 transitions. [2022-07-13 19:22:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-13 19:22:53,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:53,054 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:22:53,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:53,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 19:22:53,267 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1496592282, now seen corresponding path program 1 times [2022-07-13 19:22:53,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 19:22:53,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514164981] [2022-07-13 19:22:53,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:53,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 19:22:53,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 19:22:53,270 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 19:22:53,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 19:22:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:22:56,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 3407 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 19:22:56,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:22:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2022-07-13 19:22:56,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:22:56,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 19:22:56,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514164981] [2022-07-13 19:22:56,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514164981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:22:56,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:22:56,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 19:22:56,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043296528] [2022-07-13 19:22:56,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:22:56,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 19:22:56,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 19:22:56,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 19:22:56,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:22:56,527 INFO L87 Difference]: Start difference. First operand 199 states and 279 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 2 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-13 19:22:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:22:57,299 INFO L93 Difference]: Finished difference Result 525 states and 795 transitions. [2022-07-13 19:22:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 19:22:57,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 2 states have call predecessors, (30), 3 states have call successors, (30) Word has length 244 [2022-07-13 19:22:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:22:57,302 INFO L225 Difference]: With dead ends: 525 [2022-07-13 19:22:57,302 INFO L226 Difference]: Without dead ends: 359 [2022-07-13 19:22:57,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-13 19:22:57,305 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 142 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 19:22:57,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 581 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 19:22:57,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-13 19:22:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 304. [2022-07-13 19:22:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 208 states have (on average 1.2067307692307692) internal successors, (251), 202 states have internal predecessors, (251), 73 states have call successors, (73), 14 states have call predecessors, (73), 22 states have return successors, (111), 87 states have call predecessors, (111), 73 states have call successors, (111) [2022-07-13 19:22:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 435 transitions. [2022-07-13 19:22:57,325 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 435 transitions. Word has length 244 [2022-07-13 19:22:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:22:57,325 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 435 transitions. [2022-07-13 19:22:57,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 2 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-13 19:22:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 435 transitions. [2022-07-13 19:22:57,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-13 19:22:57,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:22:57,328 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:22:57,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 19:22:57,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 19:22:57,539 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:22:57,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:22:57,540 INFO L85 PathProgramCache]: Analyzing trace with hash -624181720, now seen corresponding path program 1 times [2022-07-13 19:22:57,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 19:22:57,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238184169] [2022-07-13 19:22:57,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:22:57,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 19:22:57,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 19:22:57,541 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 19:22:57,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 19:23:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:00,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 3408 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 19:23:00,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:23:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2022-07-13 19:23:00,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:23:00,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 19:23:00,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238184169] [2022-07-13 19:23:00,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238184169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:23:00,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:23:00,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 19:23:00,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254498576] [2022-07-13 19:23:00,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:23:00,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 19:23:00,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 19:23:00,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 19:23:00,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 19:23:00,836 INFO L87 Difference]: Start difference. First operand 304 states and 435 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-13 19:23:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:23:01,221 INFO L93 Difference]: Finished difference Result 700 states and 1024 transitions. [2022-07-13 19:23:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 19:23:01,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 244 [2022-07-13 19:23:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:23:01,224 INFO L225 Difference]: With dead ends: 700 [2022-07-13 19:23:01,224 INFO L226 Difference]: Without dead ends: 429 [2022-07-13 19:23:01,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:23:01,226 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 257 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 19:23:01,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 325 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 19:23:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-07-13 19:23:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 419. [2022-07-13 19:23:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 280 states have (on average 1.1357142857142857) internal successors, (318), 271 states have internal predecessors, (318), 111 states have call successors, (111), 17 states have call predecessors, (111), 27 states have return successors, (157), 130 states have call predecessors, (157), 111 states have call successors, (157) [2022-07-13 19:23:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 586 transitions. [2022-07-13 19:23:01,250 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 586 transitions. Word has length 244 [2022-07-13 19:23:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:23:01,250 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 586 transitions. [2022-07-13 19:23:01,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-13 19:23:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 586 transitions. [2022-07-13 19:23:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-13 19:23:01,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:23:01,256 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:23:01,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 19:23:01,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 19:23:01,474 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:23:01,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:23:01,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1590201898, now seen corresponding path program 1 times [2022-07-13 19:23:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 19:23:01,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755556553] [2022-07-13 19:23:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:23:01,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 19:23:01,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 19:23:01,477 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 19:23:01,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 19:23:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:04,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 3399 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 19:23:04,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:23:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 360 proven. 7 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2022-07-13 19:23:04,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:23:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2022-07-13 19:23:05,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 19:23:05,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755556553] [2022-07-13 19:23:05,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755556553] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:23:05,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 19:23:05,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2022-07-13 19:23:05,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107197061] [2022-07-13 19:23:05,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 19:23:05,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 19:23:05,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 19:23:05,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 19:23:05,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-13 19:23:05,199 INFO L87 Difference]: Start difference. First operand 419 states and 586 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 7 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 7 states have call predecessors, (50), 7 states have call successors, (50) [2022-07-13 19:23:07,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:23:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:23:08,923 INFO L93 Difference]: Finished difference Result 1063 states and 1530 transitions. [2022-07-13 19:23:08,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 19:23:08,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 7 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 7 states have call predecessors, (50), 7 states have call successors, (50) Word has length 244 [2022-07-13 19:23:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:23:08,927 INFO L225 Difference]: With dead ends: 1063 [2022-07-13 19:23:08,927 INFO L226 Difference]: Without dead ends: 677 [2022-07-13 19:23:08,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 19:23:08,929 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 181 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 94 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-13 19:23:08,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 517 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-07-13 19:23:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-07-13 19:23:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 660. [2022-07-13 19:23:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 445 states have (on average 1.1280898876404495) internal successors, (502), 438 states have internal predecessors, (502), 153 states have call successors, (153), 39 states have call predecessors, (153), 61 states have return successors, (263), 182 states have call predecessors, (263), 153 states have call successors, (263) [2022-07-13 19:23:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2022-07-13 19:23:08,970 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 918 transitions. Word has length 244 [2022-07-13 19:23:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:23:08,971 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 918 transitions. [2022-07-13 19:23:08,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 7 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 7 states have call predecessors, (50), 7 states have call successors, (50) [2022-07-13 19:23:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 918 transitions. [2022-07-13 19:23:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-13 19:23:08,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:23:08,975 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:23:09,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 19:23:09,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 19:23:09,199 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:23:09,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:23:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash 714181578, now seen corresponding path program 1 times [2022-07-13 19:23:09,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 19:23:09,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486026839] [2022-07-13 19:23:09,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:23:09,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 19:23:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 19:23:09,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 19:23:09,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 19:23:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:23:46,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 3501 conjuncts, 1570 conjunts are in the unsatisfiable core [2022-07-13 19:23:46,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:23:46,967 INFO L356 Elim1Store]: treesize reduction 114, result has 29.2 percent of original size [2022-07-13 19:23:46,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 1366 treesize of output 1384 [2022-07-13 19:23:47,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2022-07-13 19:23:47,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-13 19:23:47,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-07-13 19:23:48,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-07-13 19:23:48,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-07-13 19:23:48,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2022-07-13 19:23:49,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-07-13 19:23:49,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2022-07-13 19:23:58,287 INFO L356 Elim1Store]: treesize reduction 31, result has 43.6 percent of original size [2022-07-13 19:23:58,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 61 [2022-07-13 19:23:58,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2022-07-13 19:24:04,910 INFO L356 Elim1Store]: treesize reduction 39, result has 29.1 percent of original size [2022-07-13 19:24:04,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 53 [2022-07-13 19:24:04,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2022-07-13 19:24:11,445 INFO L356 Elim1Store]: treesize reduction 39, result has 29.1 percent of original size [2022-07-13 19:24:11,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 53 [2022-07-13 19:24:11,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2022-07-13 19:24:20,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-07-13 19:24:20,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2022-07-13 19:24:38,580 INFO L356 Elim1Store]: treesize reduction 31, result has 43.6 percent of original size [2022-07-13 19:24:38,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 61 [2022-07-13 19:24:38,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2022-07-13 19:24:47,353 INFO L356 Elim1Store]: treesize reduction 39, result has 29.1 percent of original size [2022-07-13 19:24:47,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 53 [2022-07-13 19:24:47,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2022-07-13 19:24:59,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2022-07-13 19:24:59,902 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 4