./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/singleton.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dc5dfed1 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/pthread/singleton.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 692248c827814d69f794d70185d48fd053222a0c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-dc5dfed [2020-12-02 22:36:12,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 22:36:12,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 22:36:12,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 22:36:12,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 22:36:12,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 22:36:12,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 22:36:12,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 22:36:12,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 22:36:12,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 22:36:12,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 22:36:12,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 22:36:12,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 22:36:12,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 22:36:12,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 22:36:12,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 22:36:12,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 22:36:12,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 22:36:12,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 22:36:12,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 22:36:12,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 22:36:12,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 22:36:12,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 22:36:12,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 22:36:12,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 22:36:12,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 22:36:12,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 22:36:12,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 22:36:12,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 22:36:12,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 22:36:12,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 22:36:12,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 22:36:12,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 22:36:12,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 22:36:12,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 22:36:12,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 22:36:12,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 22:36:12,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 22:36:12,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 22:36:12,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 22:36:12,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 22:36:12,366 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 22:36:12,419 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 22:36:12,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 22:36:12,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 22:36:12,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 22:36:12,423 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 22:36:12,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 22:36:12,424 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 22:36:12,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 22:36:12,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 22:36:12,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 22:36:12,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 22:36:12,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 22:36:12,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 22:36:12,426 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 22:36:12,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 22:36:12,427 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 22:36:12,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 22:36:12,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 22:36:12,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 22:36:12,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 22:36:12,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 22:36:12,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 22:36:12,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 22:36:12,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 22:36:12,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 22:36:12,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 22:36:12,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 22:36:12,429 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 22:36:12,430 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 -> 692248c827814d69f794d70185d48fd053222a0c [2020-12-02 22:36:12,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 22:36:12,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 22:36:12,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 22:36:12,861 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 22:36:12,862 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 22:36:12,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton.i [2020-12-02 22:36:12,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e417881/936ca8ba25024ded89a13baa9cc6230f/FLAG929049c60 [2020-12-02 22:36:13,845 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 22:36:13,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i [2020-12-02 22:36:13,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e417881/936ca8ba25024ded89a13baa9cc6230f/FLAG929049c60 [2020-12-02 22:36:14,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e417881/936ca8ba25024ded89a13baa9cc6230f [2020-12-02 22:36:14,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 22:36:14,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 22:36:14,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 22:36:14,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 22:36:14,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 22:36:14,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:36:14" (1/1) ... [2020-12-02 22:36:14,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b4160b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:14, skipping insertion in model container [2020-12-02 22:36:14,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:36:14" (1/1) ... [2020-12-02 22:36:14,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 22:36:14,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 22:36:14,436 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-02 22:36:14,780 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-02 22:36:14,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 22:36:14,809 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 22:36:14,828 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-02 22:36:14,852 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-02 22:36:14,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 22:36:15,110 INFO L208 MainTranslator]: Completed translation [2020-12-02 22:36:15,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:15 WrapperNode [2020-12-02 22:36:15,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 22:36:15,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 22:36:15,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 22:36:15,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 22:36:15,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:15" (1/1) ... [2020-12-02 22:36:15,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:15" (1/1) ... [2020-12-02 22:36:15,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 22:36:15,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 22:36:15,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 22:36:15,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 22:36:15,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:15" (1/1) ... [2020-12-02 22:36:15,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:15" (1/1) ... [2020-12-02 22:36:15,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:15" (1/1) ... [2020-12-02 22:36:15,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:15" (1/1) ... [2020-12-02 22:36:15,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:15" (1/1) ... [2020-12-02 22:36:15,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:15" (1/1) ... [2020-12-02 22:36:15,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:15" (1/1) ... [2020-12-02 22:36:15,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 22:36:15,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 22:36:15,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 22:36:15,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 22:36:15,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 22:36:15,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 22:36:15,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 22:36:15,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 22:36:15,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 22:36:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-02 22:36:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-12-02 22:36:15,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-12-02 22:36:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-12-02 22:36:15,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-12-02 22:36:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-12-02 22:36:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-12-02 22:36:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-12-02 22:36:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-12-02 22:36:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 22:36:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-02 22:36:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 22:36:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 22:36:15,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 22:36:15,338 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-02 22:36:15,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 22:36:15,875 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-02 22:36:15,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:36:15 BoogieIcfgContainer [2020-12-02 22:36:15,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 22:36:15,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 22:36:15,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 22:36:15,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 22:36:15,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:36:14" (1/3) ... [2020-12-02 22:36:15,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693fd418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:36:15, skipping insertion in model container [2020-12-02 22:36:15,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:15" (2/3) ... [2020-12-02 22:36:15,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693fd418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:36:15, skipping insertion in model container [2020-12-02 22:36:15,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:36:15" (3/3) ... [2020-12-02 22:36:15,891 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-12-02 22:36:15,909 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 22:36:15,909 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 22:36:15,913 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 22:36:15,914 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 22:36:15,982 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,983 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,983 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,983 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,989 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,989 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,989 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,990 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,991 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,991 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,992 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,993 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,993 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,993 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,993 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,994 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,994 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,994 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,995 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,995 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,995 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,995 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,996 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,997 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,997 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,997 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,998 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:15,999 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,000 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,000 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,000 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,001 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,001 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,001 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,003 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,003 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,003 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,015 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,015 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,015 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,018 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,018 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,018 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,019 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,019 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,019 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,019 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,020 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,020 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,020 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,020 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,020 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,021 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,021 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,021 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,021 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,021 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,022 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,022 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,022 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,023 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,023 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,023 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,023 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,023 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,024 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,024 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,024 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,024 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,024 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,025 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,025 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,025 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,025 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,025 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,026 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,026 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,026 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,026 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,027 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,027 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,028 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,028 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,028 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,029 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,029 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,032 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,032 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,033 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,033 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,033 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,034 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,035 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,036 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,047 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,048 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,048 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,048 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,048 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,048 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,048 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,049 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,049 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,049 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,049 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,049 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,050 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,050 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,050 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,050 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,051 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,051 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,052 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,052 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,052 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,052 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,052 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,052 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,053 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,053 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,053 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,053 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,054 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,054 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,054 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,054 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,055 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,055 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,056 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,056 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,056 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,057 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,057 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,057 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,058 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,058 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,058 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,058 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,058 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,059 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,060 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,060 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,061 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,061 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,061 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,061 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,062 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,062 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,062 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,062 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,062 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,062 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,063 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,063 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,063 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,064 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,064 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,064 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,064 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,064 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,064 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,064 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,065 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,065 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,066 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,066 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,067 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,067 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,067 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,067 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,067 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,067 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,067 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,068 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,068 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,068 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,068 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,068 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,074 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,075 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,075 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,075 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,080 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,080 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,080 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,081 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,084 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,085 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,085 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,085 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,088 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,091 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,092 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,092 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,092 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,092 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,101 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,101 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,101 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,101 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,102 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,102 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,102 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,103 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,103 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,103 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,104 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,104 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,104 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,104 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,104 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,104 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,105 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,105 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,106 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,110 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,118 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,118 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,118 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,120 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,120 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,121 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,121 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,121 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,124 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,125 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,126 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,126 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,126 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,129 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,129 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,130 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,130 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,133 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,133 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,133 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,133 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,135 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,135 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,135 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,135 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 22:36:16,255 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2020-12-02 22:36:16,269 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-12-02 22:36:16,292 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 22:36:16,293 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 22:36:16,293 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 22:36:16,293 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 22:36:16,293 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 22:36:16,293 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 22:36:16,293 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 22:36:16,294 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 22:36:16,313 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 22:36:16,315 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-02 22:36:16,318 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-02 22:36:16,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 248 transitions, 876 flow [2020-12-02 22:36:16,437 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2020-12-02 22:36:16,437 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-12-02 22:36:16,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 274 events. 61/274 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 804 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 330. Up to 24 conditions per place. [2020-12-02 22:36:16,459 INFO L116 LiptonReduction]: Number of co-enabled transitions 4156 [2020-12-02 22:36:19,203 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-02 22:36:19,312 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-02 22:36:19,425 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-02 22:36:19,532 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-02 22:36:19,867 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-02 22:36:20,061 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-02 22:36:20,240 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-02 22:36:20,348 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-02 22:36:20,466 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-02 22:36:20,830 INFO L131 LiptonReduction]: Checked pairs total: 49018 [2020-12-02 22:36:20,830 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-02 22:36:20,837 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 173 transitions, 726 flow [2020-12-02 22:36:21,424 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-12-02 22:36:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-12-02 22:36:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 22:36:21,433 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:21,434 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:21,435 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:21,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1391244601, now seen corresponding path program 1 times [2020-12-02 22:36:21,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:21,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572825125] [2020-12-02 22:36:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:21,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572825125] [2020-12-02 22:36:21,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:21,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 22:36:21,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681945030] [2020-12-02 22:36:21,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 22:36:21,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 22:36:21,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 22:36:21,819 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-12-02 22:36:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:22,185 INFO L93 Difference]: Finished difference Result 6012 states and 25679 transitions. [2020-12-02 22:36:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 22:36:22,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-02 22:36:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:22,286 INFO L225 Difference]: With dead ends: 6012 [2020-12-02 22:36:22,286 INFO L226 Difference]: Without dead ends: 5524 [2020-12-02 22:36:22,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-02 22:36:22,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2020-12-02 22:36:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 3018. [2020-12-02 22:36:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-12-02 22:36:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-12-02 22:36:22,590 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-12-02 22:36:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:22,591 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-12-02 22:36:22,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 22:36:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-12-02 22:36:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 22:36:22,592 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:22,592 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:22,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 22:36:22,593 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:22,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1473766845, now seen corresponding path program 2 times [2020-12-02 22:36:22,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:22,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307553745] [2020-12-02 22:36:22,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:22,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307553745] [2020-12-02 22:36:22,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:22,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 22:36:22,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131437724] [2020-12-02 22:36:22,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 22:36:22,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:22,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 22:36:22,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 22:36:22,703 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-12-02 22:36:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:22,976 INFO L93 Difference]: Finished difference Result 4266 states and 18042 transitions. [2020-12-02 22:36:22,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 22:36:22,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-02 22:36:22,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:23,022 INFO L225 Difference]: With dead ends: 4266 [2020-12-02 22:36:23,022 INFO L226 Difference]: Without dead ends: 4266 [2020-12-02 22:36:23,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 22:36:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2020-12-02 22:36:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 3008. [2020-12-02 22:36:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-12-02 22:36:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-12-02 22:36:23,242 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-12-02 22:36:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:23,242 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-12-02 22:36:23,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 22:36:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-12-02 22:36:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 22:36:23,245 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:23,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:23,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 22:36:23,246 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:23,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:23,247 INFO L82 PathProgramCache]: Analyzing trace with hash -658761216, now seen corresponding path program 1 times [2020-12-02 22:36:23,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:23,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261372019] [2020-12-02 22:36:23,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:23,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261372019] [2020-12-02 22:36:23,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:23,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 22:36:23,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723891531] [2020-12-02 22:36:23,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 22:36:23,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:23,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 22:36:23,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 22:36:23,359 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-12-02 22:36:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:23,464 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-12-02 22:36:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 22:36:23,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-02 22:36:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:23,497 INFO L225 Difference]: With dead ends: 4848 [2020-12-02 22:36:23,498 INFO L226 Difference]: Without dead ends: 3558 [2020-12-02 22:36:23,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 22:36:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-12-02 22:36:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-12-02 22:36:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-12-02 22:36:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-12-02 22:36:23,692 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-12-02 22:36:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:23,693 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-12-02 22:36:23,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 22:36:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-12-02 22:36:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 22:36:23,695 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:23,696 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:23,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 22:36:23,696 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:23,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:23,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1053238145, now seen corresponding path program 1 times [2020-12-02 22:36:23,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:23,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557495996] [2020-12-02 22:36:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:23,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557495996] [2020-12-02 22:36:23,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:23,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 22:36:23,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696737637] [2020-12-02 22:36:23,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 22:36:23,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 22:36:23,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 22:36:23,762 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-12-02 22:36:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:24,077 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-12-02 22:36:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 22:36:24,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-02 22:36:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:24,110 INFO L225 Difference]: With dead ends: 4417 [2020-12-02 22:36:24,110 INFO L226 Difference]: Without dead ends: 4393 [2020-12-02 22:36:24,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 22:36:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-12-02 22:36:24,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-12-02 22:36:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-12-02 22:36:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-12-02 22:36:24,320 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-12-02 22:36:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:24,321 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-12-02 22:36:24,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 22:36:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-12-02 22:36:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 22:36:24,329 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:24,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:24,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 22:36:24,330 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:24,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:24,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1471262403, now seen corresponding path program 2 times [2020-12-02 22:36:24,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:24,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287560488] [2020-12-02 22:36:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:24,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287560488] [2020-12-02 22:36:24,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:24,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 22:36:24,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329631128] [2020-12-02 22:36:24,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 22:36:24,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:24,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 22:36:24,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 22:36:24,452 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-12-02 22:36:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:24,642 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-12-02 22:36:24,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 22:36:24,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-02 22:36:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:24,661 INFO L225 Difference]: With dead ends: 4024 [2020-12-02 22:36:24,661 INFO L226 Difference]: Without dead ends: 4024 [2020-12-02 22:36:24,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 22:36:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-12-02 22:36:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-12-02 22:36:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-12-02 22:36:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-12-02 22:36:24,800 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-12-02 22:36:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:24,801 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-12-02 22:36:24,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 22:36:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-12-02 22:36:24,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 22:36:24,803 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:24,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:24,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 22:36:24,804 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:24,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash -564581282, now seen corresponding path program 1 times [2020-12-02 22:36:24,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:24,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300257419] [2020-12-02 22:36:24,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:24,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300257419] [2020-12-02 22:36:24,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:24,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 22:36:24,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422531225] [2020-12-02 22:36:24,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 22:36:24,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:24,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 22:36:24,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 22:36:24,885 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-12-02 22:36:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:25,161 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-12-02 22:36:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 22:36:25,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-02 22:36:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:25,184 INFO L225 Difference]: With dead ends: 4225 [2020-12-02 22:36:25,184 INFO L226 Difference]: Without dead ends: 4129 [2020-12-02 22:36:25,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 22:36:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-12-02 22:36:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-12-02 22:36:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-12-02 22:36:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-12-02 22:36:25,315 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-12-02 22:36:25,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:25,316 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-12-02 22:36:25,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 22:36:25,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-12-02 22:36:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 22:36:25,318 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:25,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:25,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 22:36:25,318 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:25,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:25,319 INFO L82 PathProgramCache]: Analyzing trace with hash -490731172, now seen corresponding path program 2 times [2020-12-02 22:36:25,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:25,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693781439] [2020-12-02 22:36:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:25,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693781439] [2020-12-02 22:36:25,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:25,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 22:36:25,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194744563] [2020-12-02 22:36:25,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 22:36:25,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:25,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 22:36:25,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 22:36:25,488 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2020-12-02 22:36:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:25,923 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-12-02 22:36:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 22:36:25,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-02 22:36:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:25,948 INFO L225 Difference]: With dead ends: 4979 [2020-12-02 22:36:25,949 INFO L226 Difference]: Without dead ends: 4905 [2020-12-02 22:36:25,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-02 22:36:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-12-02 22:36:26,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-12-02 22:36:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-02 22:36:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-12-02 22:36:26,177 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-12-02 22:36:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:26,177 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-12-02 22:36:26,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 22:36:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-12-02 22:36:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 22:36:26,179 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:26,180 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:26,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 22:36:26,180 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash 991975414, now seen corresponding path program 3 times [2020-12-02 22:36:26,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:26,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884861951] [2020-12-02 22:36:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:26,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884861951] [2020-12-02 22:36:26,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:26,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 22:36:26,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437466249] [2020-12-02 22:36:26,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 22:36:26,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:26,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 22:36:26,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-02 22:36:26,328 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2020-12-02 22:36:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:26,768 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-12-02 22:36:26,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 22:36:26,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-02 22:36:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:26,802 INFO L225 Difference]: With dead ends: 6735 [2020-12-02 22:36:26,803 INFO L226 Difference]: Without dead ends: 6661 [2020-12-02 22:36:26,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-02 22:36:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-12-02 22:36:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-12-02 22:36:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-12-02 22:36:27,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-12-02 22:36:27,075 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-12-02 22:36:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:27,076 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-12-02 22:36:27,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 22:36:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-12-02 22:36:27,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 22:36:27,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:27,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:27,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 22:36:27,078 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:27,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1869283970, now seen corresponding path program 4 times [2020-12-02 22:36:27,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:27,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884783555] [2020-12-02 22:36:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:27,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884783555] [2020-12-02 22:36:27,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:27,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 22:36:27,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649669319] [2020-12-02 22:36:27,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 22:36:27,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 22:36:27,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-02 22:36:27,191 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 9 states. [2020-12-02 22:36:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:27,509 INFO L93 Difference]: Finished difference Result 5385 states and 21914 transitions. [2020-12-02 22:36:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 22:36:27,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-02 22:36:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:27,527 INFO L225 Difference]: With dead ends: 5385 [2020-12-02 22:36:27,527 INFO L226 Difference]: Without dead ends: 5311 [2020-12-02 22:36:27,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:27,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2020-12-02 22:36:27,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4125. [2020-12-02 22:36:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2020-12-02 22:36:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 16604 transitions. [2020-12-02 22:36:27,674 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 16604 transitions. Word has length 18 [2020-12-02 22:36:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:27,678 INFO L481 AbstractCegarLoop]: Abstraction has 4125 states and 16604 transitions. [2020-12-02 22:36:27,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 22:36:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 16604 transitions. [2020-12-02 22:36:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 22:36:27,680 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:27,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:27,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 22:36:27,680 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:27,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:27,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1339896726, now seen corresponding path program 5 times [2020-12-02 22:36:27,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:27,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829649802] [2020-12-02 22:36:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:27,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829649802] [2020-12-02 22:36:27,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:27,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 22:36:27,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108515355] [2020-12-02 22:36:27,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 22:36:27,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:27,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 22:36:27,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-02 22:36:27,934 INFO L87 Difference]: Start difference. First operand 4125 states and 16604 transitions. Second operand 11 states. [2020-12-02 22:36:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:28,777 INFO L93 Difference]: Finished difference Result 5686 states and 23415 transitions. [2020-12-02 22:36:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 22:36:28,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-12-02 22:36:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:28,799 INFO L225 Difference]: With dead ends: 5686 [2020-12-02 22:36:28,799 INFO L226 Difference]: Without dead ends: 5630 [2020-12-02 22:36:28,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-02 22:36:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2020-12-02 22:36:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4116. [2020-12-02 22:36:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2020-12-02 22:36:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2020-12-02 22:36:28,952 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2020-12-02 22:36:28,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:28,953 INFO L481 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2020-12-02 22:36:28,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 22:36:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2020-12-02 22:36:28,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 22:36:28,956 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:28,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:28,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 22:36:28,956 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:28,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1845549347, now seen corresponding path program 1 times [2020-12-02 22:36:28,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:28,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061698506] [2020-12-02 22:36:28,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:29,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061698506] [2020-12-02 22:36:29,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:29,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 22:36:29,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855487922] [2020-12-02 22:36:29,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 22:36:29,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:29,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 22:36:29,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 22:36:29,034 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 6 states. [2020-12-02 22:36:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:29,156 INFO L93 Difference]: Finished difference Result 4687 states and 18325 transitions. [2020-12-02 22:36:29,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 22:36:29,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-02 22:36:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:29,168 INFO L225 Difference]: With dead ends: 4687 [2020-12-02 22:36:29,168 INFO L226 Difference]: Without dead ends: 4687 [2020-12-02 22:36:29,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 22:36:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-02 22:36:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4131. [2020-12-02 22:36:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-02 22:36:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16621 transitions. [2020-12-02 22:36:29,296 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16621 transitions. Word has length 19 [2020-12-02 22:36:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:29,297 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16621 transitions. [2020-12-02 22:36:29,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 22:36:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16621 transitions. [2020-12-02 22:36:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 22:36:29,299 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:29,300 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:29,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 22:36:29,300 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:29,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:29,301 INFO L82 PathProgramCache]: Analyzing trace with hash 838752707, now seen corresponding path program 2 times [2020-12-02 22:36:29,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:29,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302937391] [2020-12-02 22:36:29,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:29,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302937391] [2020-12-02 22:36:29,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:29,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 22:36:29,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314814395] [2020-12-02 22:36:29,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 22:36:29,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:29,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 22:36:29,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 22:36:29,375 INFO L87 Difference]: Start difference. First operand 4131 states and 16621 transitions. Second operand 7 states. [2020-12-02 22:36:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:29,492 INFO L93 Difference]: Finished difference Result 4619 states and 18100 transitions. [2020-12-02 22:36:29,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 22:36:29,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-12-02 22:36:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:29,509 INFO L225 Difference]: With dead ends: 4619 [2020-12-02 22:36:29,509 INFO L226 Difference]: Without dead ends: 4619 [2020-12-02 22:36:29,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-02 22:36:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2020-12-02 22:36:29,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4078. [2020-12-02 22:36:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2020-12-02 22:36:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2020-12-02 22:36:29,703 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2020-12-02 22:36:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:29,704 INFO L481 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2020-12-02 22:36:29,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 22:36:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2020-12-02 22:36:29,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 22:36:29,706 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:29,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:29,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-02 22:36:29,707 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:29,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:29,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1368539430, now seen corresponding path program 1 times [2020-12-02 22:36:29,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:29,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762768152] [2020-12-02 22:36:29,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:29,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762768152] [2020-12-02 22:36:29,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:29,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 22:36:29,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194413929] [2020-12-02 22:36:29,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 22:36:29,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:29,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 22:36:29,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-02 22:36:29,914 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 10 states. [2020-12-02 22:36:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:30,564 INFO L93 Difference]: Finished difference Result 5300 states and 21612 transitions. [2020-12-02 22:36:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 22:36:30,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-12-02 22:36:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:30,584 INFO L225 Difference]: With dead ends: 5300 [2020-12-02 22:36:30,584 INFO L226 Difference]: Without dead ends: 5226 [2020-12-02 22:36:30,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-02 22:36:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2020-12-02 22:36:30,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 4066. [2020-12-02 22:36:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2020-12-02 22:36:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 16392 transitions. [2020-12-02 22:36:30,729 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 16392 transitions. Word has length 19 [2020-12-02 22:36:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:30,730 INFO L481 AbstractCegarLoop]: Abstraction has 4066 states and 16392 transitions. [2020-12-02 22:36:30,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 22:36:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 16392 transitions. [2020-12-02 22:36:30,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 22:36:30,734 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:30,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:30,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-02 22:36:30,734 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:30,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:30,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1392670140, now seen corresponding path program 2 times [2020-12-02 22:36:30,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:30,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680699927] [2020-12-02 22:36:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:31,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680699927] [2020-12-02 22:36:31,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:31,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 22:36:31,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156910002] [2020-12-02 22:36:31,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 22:36:31,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:31,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 22:36:31,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:31,009 INFO L87 Difference]: Start difference. First operand 4066 states and 16392 transitions. Second operand 12 states. [2020-12-02 22:36:31,363 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-12-02 22:36:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:31,980 INFO L93 Difference]: Finished difference Result 5713 states and 23638 transitions. [2020-12-02 22:36:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 22:36:31,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-12-02 22:36:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:32,002 INFO L225 Difference]: With dead ends: 5713 [2020-12-02 22:36:32,003 INFO L226 Difference]: Without dead ends: 5651 [2020-12-02 22:36:32,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-12-02 22:36:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2020-12-02 22:36:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 4021. [2020-12-02 22:36:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2020-12-02 22:36:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 16226 transitions. [2020-12-02 22:36:32,170 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 16226 transitions. Word has length 19 [2020-12-02 22:36:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:32,170 INFO L481 AbstractCegarLoop]: Abstraction has 4021 states and 16226 transitions. [2020-12-02 22:36:32,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 22:36:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 16226 transitions. [2020-12-02 22:36:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 22:36:32,175 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:32,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:32,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-02 22:36:32,176 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:32,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:32,177 INFO L82 PathProgramCache]: Analyzing trace with hash -638770199, now seen corresponding path program 1 times [2020-12-02 22:36:32,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:32,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14761584] [2020-12-02 22:36:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:32,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14761584] [2020-12-02 22:36:32,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:32,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 22:36:32,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185955201] [2020-12-02 22:36:32,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 22:36:32,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:32,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 22:36:32,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-02 22:36:32,274 INFO L87 Difference]: Start difference. First operand 4021 states and 16226 transitions. Second operand 8 states. [2020-12-02 22:36:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:32,591 INFO L93 Difference]: Finished difference Result 6240 states and 25278 transitions. [2020-12-02 22:36:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 22:36:32,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-02 22:36:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:32,618 INFO L225 Difference]: With dead ends: 6240 [2020-12-02 22:36:32,618 INFO L226 Difference]: Without dead ends: 6194 [2020-12-02 22:36:32,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-12-02 22:36:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6194 states. [2020-12-02 22:36:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6194 to 4020. [2020-12-02 22:36:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2020-12-02 22:36:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 16225 transitions. [2020-12-02 22:36:32,805 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 16225 transitions. Word has length 20 [2020-12-02 22:36:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:32,805 INFO L481 AbstractCegarLoop]: Abstraction has 4020 states and 16225 transitions. [2020-12-02 22:36:32,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 22:36:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 16225 transitions. [2020-12-02 22:36:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 22:36:32,808 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:32,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:32,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-02 22:36:32,809 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:32,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:32,810 INFO L82 PathProgramCache]: Analyzing trace with hash -78568143, now seen corresponding path program 2 times [2020-12-02 22:36:32,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:32,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286799613] [2020-12-02 22:36:32,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:32,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286799613] [2020-12-02 22:36:32,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:32,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 22:36:32,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972490130] [2020-12-02 22:36:32,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 22:36:32,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:32,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 22:36:32,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-02 22:36:32,893 INFO L87 Difference]: Start difference. First operand 4020 states and 16225 transitions. Second operand 8 states. [2020-12-02 22:36:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:33,146 INFO L93 Difference]: Finished difference Result 5057 states and 20246 transitions. [2020-12-02 22:36:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 22:36:33,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-02 22:36:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:33,167 INFO L225 Difference]: With dead ends: 5057 [2020-12-02 22:36:33,168 INFO L226 Difference]: Without dead ends: 5011 [2020-12-02 22:36:33,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-02 22:36:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2020-12-02 22:36:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 4017. [2020-12-02 22:36:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4017 states. [2020-12-02 22:36:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 16218 transitions. [2020-12-02 22:36:33,327 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 16218 transitions. Word has length 20 [2020-12-02 22:36:33,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:33,328 INFO L481 AbstractCegarLoop]: Abstraction has 4017 states and 16218 transitions. [2020-12-02 22:36:33,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 22:36:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 16218 transitions. [2020-12-02 22:36:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 22:36:33,330 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:33,335 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:33,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-02 22:36:33,335 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:33,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:33,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1686883325, now seen corresponding path program 3 times [2020-12-02 22:36:33,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:33,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059363512] [2020-12-02 22:36:33,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:33,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059363512] [2020-12-02 22:36:33,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:33,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 22:36:33,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760313303] [2020-12-02 22:36:33,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 22:36:33,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:33,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 22:36:33,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-02 22:36:33,495 INFO L87 Difference]: Start difference. First operand 4017 states and 16218 transitions. Second operand 9 states. [2020-12-02 22:36:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:34,012 INFO L93 Difference]: Finished difference Result 5047 states and 20222 transitions. [2020-12-02 22:36:34,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 22:36:34,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-12-02 22:36:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:34,027 INFO L225 Difference]: With dead ends: 5047 [2020-12-02 22:36:34,027 INFO L226 Difference]: Without dead ends: 5001 [2020-12-02 22:36:34,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-12-02 22:36:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2020-12-02 22:36:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4010. [2020-12-02 22:36:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4010 states. [2020-12-02 22:36:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 16199 transitions. [2020-12-02 22:36:34,170 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 16199 transitions. Word has length 20 [2020-12-02 22:36:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:34,170 INFO L481 AbstractCegarLoop]: Abstraction has 4010 states and 16199 transitions. [2020-12-02 22:36:34,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 22:36:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 16199 transitions. [2020-12-02 22:36:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 22:36:34,173 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:34,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:34,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-02 22:36:34,174 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:34,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:34,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1644928641, now seen corresponding path program 4 times [2020-12-02 22:36:34,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:34,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710160675] [2020-12-02 22:36:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:34,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710160675] [2020-12-02 22:36:34,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:34,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 22:36:34,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629450736] [2020-12-02 22:36:34,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 22:36:34,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:34,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 22:36:34,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-02 22:36:34,382 INFO L87 Difference]: Start difference. First operand 4010 states and 16199 transitions. Second operand 11 states. [2020-12-02 22:36:35,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:35,100 INFO L93 Difference]: Finished difference Result 5545 states and 22382 transitions. [2020-12-02 22:36:35,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 22:36:35,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-02 22:36:35,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:35,118 INFO L225 Difference]: With dead ends: 5545 [2020-12-02 22:36:35,119 INFO L226 Difference]: Without dead ends: 5499 [2020-12-02 22:36:35,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-12-02 22:36:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2020-12-02 22:36:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4140. [2020-12-02 22:36:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-02 22:36:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16867 transitions. [2020-12-02 22:36:35,231 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16867 transitions. Word has length 20 [2020-12-02 22:36:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:35,232 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16867 transitions. [2020-12-02 22:36:35,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 22:36:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16867 transitions. [2020-12-02 22:36:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 22:36:35,235 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:35,235 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:35,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-02 22:36:35,235 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1818104208, now seen corresponding path program 1 times [2020-12-02 22:36:35,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:35,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113897385] [2020-12-02 22:36:35,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:35,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113897385] [2020-12-02 22:36:35,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:35,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 22:36:35,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94459145] [2020-12-02 22:36:35,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 22:36:35,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:35,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 22:36:35,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-02 22:36:35,472 INFO L87 Difference]: Start difference. First operand 4140 states and 16867 transitions. Second operand 11 states. [2020-12-02 22:36:36,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:36,279 INFO L93 Difference]: Finished difference Result 6397 states and 25724 transitions. [2020-12-02 22:36:36,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-02 22:36:36,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-02 22:36:36,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:36,296 INFO L225 Difference]: With dead ends: 6397 [2020-12-02 22:36:36,296 INFO L226 Difference]: Without dead ends: 6351 [2020-12-02 22:36:36,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-02 22:36:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2020-12-02 22:36:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 4140. [2020-12-02 22:36:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-02 22:36:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16868 transitions. [2020-12-02 22:36:36,388 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16868 transitions. Word has length 20 [2020-12-02 22:36:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:36,388 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16868 transitions. [2020-12-02 22:36:36,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 22:36:36,388 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16868 transitions. [2020-12-02 22:36:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 22:36:36,392 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:36,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:36,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-02 22:36:36,392 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:36,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:36,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1599554532, now seen corresponding path program 2 times [2020-12-02 22:36:36,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:36,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077505874] [2020-12-02 22:36:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:36,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077505874] [2020-12-02 22:36:36,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:36,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 22:36:36,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431690526] [2020-12-02 22:36:36,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 22:36:36,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:36,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 22:36:36,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-02 22:36:36,584 INFO L87 Difference]: Start difference. First operand 4140 states and 16868 transitions. Second operand 11 states. [2020-12-02 22:36:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:37,294 INFO L93 Difference]: Finished difference Result 5409 states and 21869 transitions. [2020-12-02 22:36:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-02 22:36:37,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-02 22:36:37,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:37,309 INFO L225 Difference]: With dead ends: 5409 [2020-12-02 22:36:37,309 INFO L226 Difference]: Without dead ends: 5363 [2020-12-02 22:36:37,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-12-02 22:36:37,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2020-12-02 22:36:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 4142. [2020-12-02 22:36:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2020-12-02 22:36:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 16874 transitions. [2020-12-02 22:36:37,405 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 16874 transitions. Word has length 20 [2020-12-02 22:36:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:37,406 INFO L481 AbstractCegarLoop]: Abstraction has 4142 states and 16874 transitions. [2020-12-02 22:36:37,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 22:36:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 16874 transitions. [2020-12-02 22:36:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 22:36:37,409 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:37,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:37,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-02 22:36:37,410 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:37,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1117675172, now seen corresponding path program 3 times [2020-12-02 22:36:37,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:37,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368045792] [2020-12-02 22:36:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:37,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368045792] [2020-12-02 22:36:37,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:37,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 22:36:37,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988365951] [2020-12-02 22:36:37,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 22:36:37,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:37,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 22:36:37,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-02 22:36:37,545 INFO L87 Difference]: Start difference. First operand 4142 states and 16874 transitions. Second operand 10 states. [2020-12-02 22:36:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:38,058 INFO L93 Difference]: Finished difference Result 6189 states and 24832 transitions. [2020-12-02 22:36:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 22:36:38,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-02 22:36:38,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:38,078 INFO L225 Difference]: With dead ends: 6189 [2020-12-02 22:36:38,078 INFO L226 Difference]: Without dead ends: 6143 [2020-12-02 22:36:38,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-02 22:36:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2020-12-02 22:36:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 4141. [2020-12-02 22:36:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4141 states. [2020-12-02 22:36:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 16873 transitions. [2020-12-02 22:36:38,201 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 16873 transitions. Word has length 20 [2020-12-02 22:36:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:38,201 INFO L481 AbstractCegarLoop]: Abstraction has 4141 states and 16873 transitions. [2020-12-02 22:36:38,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 22:36:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 16873 transitions. [2020-12-02 22:36:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 22:36:38,205 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:38,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:38,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-02 22:36:38,206 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:38,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:38,206 INFO L82 PathProgramCache]: Analyzing trace with hash -240366616, now seen corresponding path program 4 times [2020-12-02 22:36:38,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:38,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452795048] [2020-12-02 22:36:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:38,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452795048] [2020-12-02 22:36:38,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:38,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 22:36:38,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570512610] [2020-12-02 22:36:38,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 22:36:38,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 22:36:38,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-02 22:36:38,355 INFO L87 Difference]: Start difference. First operand 4141 states and 16873 transitions. Second operand 10 states. [2020-12-02 22:36:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:38,750 INFO L93 Difference]: Finished difference Result 5246 states and 21125 transitions. [2020-12-02 22:36:38,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 22:36:38,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-02 22:36:38,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:38,762 INFO L225 Difference]: With dead ends: 5246 [2020-12-02 22:36:38,762 INFO L226 Difference]: Without dead ends: 5200 [2020-12-02 22:36:38,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-12-02 22:36:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2020-12-02 22:36:38,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 3983. [2020-12-02 22:36:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2020-12-02 22:36:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 16133 transitions. [2020-12-02 22:36:38,843 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 16133 transitions. Word has length 20 [2020-12-02 22:36:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:38,843 INFO L481 AbstractCegarLoop]: Abstraction has 3983 states and 16133 transitions. [2020-12-02 22:36:38,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 22:36:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 16133 transitions. [2020-12-02 22:36:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 22:36:38,846 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:38,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:38,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-02 22:36:38,846 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:38,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash -565771751, now seen corresponding path program 1 times [2020-12-02 22:36:38,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:38,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737768840] [2020-12-02 22:36:38,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:38,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737768840] [2020-12-02 22:36:38,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:38,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 22:36:38,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236759265] [2020-12-02 22:36:38,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 22:36:38,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:38,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 22:36:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 22:36:38,946 INFO L87 Difference]: Start difference. First operand 3983 states and 16133 transitions. Second operand 6 states. [2020-12-02 22:36:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:39,142 INFO L93 Difference]: Finished difference Result 4762 states and 18800 transitions. [2020-12-02 22:36:39,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 22:36:39,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-02 22:36:39,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:39,157 INFO L225 Difference]: With dead ends: 4762 [2020-12-02 22:36:39,157 INFO L226 Difference]: Without dead ends: 4687 [2020-12-02 22:36:39,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 22:36:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-02 22:36:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4305. [2020-12-02 22:36:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2020-12-02 22:36:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 17320 transitions. [2020-12-02 22:36:39,248 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 17320 transitions. Word has length 21 [2020-12-02 22:36:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:39,249 INFO L481 AbstractCegarLoop]: Abstraction has 4305 states and 17320 transitions. [2020-12-02 22:36:39,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 22:36:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 17320 transitions. [2020-12-02 22:36:39,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 22:36:39,252 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:39,253 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:39,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-02 22:36:39,253 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:39,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:39,254 INFO L82 PathProgramCache]: Analyzing trace with hash 479599707, now seen corresponding path program 2 times [2020-12-02 22:36:39,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:39,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939465330] [2020-12-02 22:36:39,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:39,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939465330] [2020-12-02 22:36:39,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:39,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 22:36:39,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994200518] [2020-12-02 22:36:39,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 22:36:39,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:39,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 22:36:39,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 22:36:39,299 INFO L87 Difference]: Start difference. First operand 4305 states and 17320 transitions. Second operand 6 states. [2020-12-02 22:36:39,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:39,394 INFO L93 Difference]: Finished difference Result 5233 states and 20429 transitions. [2020-12-02 22:36:39,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 22:36:39,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-02 22:36:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:39,404 INFO L225 Difference]: With dead ends: 5233 [2020-12-02 22:36:39,404 INFO L226 Difference]: Without dead ends: 4707 [2020-12-02 22:36:39,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 22:36:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4707 states. [2020-12-02 22:36:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4707 to 3933. [2020-12-02 22:36:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3933 states. [2020-12-02 22:36:39,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 15536 transitions. [2020-12-02 22:36:39,473 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 15536 transitions. Word has length 21 [2020-12-02 22:36:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:39,474 INFO L481 AbstractCegarLoop]: Abstraction has 3933 states and 15536 transitions. [2020-12-02 22:36:39,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 22:36:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 15536 transitions. [2020-12-02 22:36:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 22:36:39,477 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:39,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:39,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-02 22:36:39,478 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:39,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:39,478 INFO L82 PathProgramCache]: Analyzing trace with hash -586116813, now seen corresponding path program 1 times [2020-12-02 22:36:39,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:39,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171394662] [2020-12-02 22:36:39,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:39,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171394662] [2020-12-02 22:36:39,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:39,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 22:36:39,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116193193] [2020-12-02 22:36:39,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 22:36:39,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:39,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 22:36:39,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-02 22:36:39,655 INFO L87 Difference]: Start difference. First operand 3933 states and 15536 transitions. Second operand 10 states. [2020-12-02 22:36:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:40,257 INFO L93 Difference]: Finished difference Result 4734 states and 18567 transitions. [2020-12-02 22:36:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 22:36:40,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-12-02 22:36:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:40,268 INFO L225 Difference]: With dead ends: 4734 [2020-12-02 22:36:40,269 INFO L226 Difference]: Without dead ends: 4685 [2020-12-02 22:36:40,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-02 22:36:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2020-12-02 22:36:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 3841. [2020-12-02 22:36:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2020-12-02 22:36:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 15162 transitions. [2020-12-02 22:36:40,337 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 15162 transitions. Word has length 21 [2020-12-02 22:36:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:40,337 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 15162 transitions. [2020-12-02 22:36:40,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 22:36:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 15162 transitions. [2020-12-02 22:36:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 22:36:40,339 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:40,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:40,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-02 22:36:40,339 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:40,340 INFO L82 PathProgramCache]: Analyzing trace with hash -757352757, now seen corresponding path program 1 times [2020-12-02 22:36:40,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:40,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216150722] [2020-12-02 22:36:40,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:40,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216150722] [2020-12-02 22:36:40,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:40,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 22:36:40,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893174412] [2020-12-02 22:36:40,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 22:36:40,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:40,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 22:36:40,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:40,628 INFO L87 Difference]: Start difference. First operand 3841 states and 15162 transitions. Second operand 12 states. [2020-12-02 22:36:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:41,711 INFO L93 Difference]: Finished difference Result 5118 states and 20406 transitions. [2020-12-02 22:36:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-02 22:36:41,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-02 22:36:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:41,723 INFO L225 Difference]: With dead ends: 5118 [2020-12-02 22:36:41,723 INFO L226 Difference]: Without dead ends: 4964 [2020-12-02 22:36:41,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2020-12-02 22:36:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2020-12-02 22:36:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 3443. [2020-12-02 22:36:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2020-12-02 22:36:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 13378 transitions. [2020-12-02 22:36:41,787 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 13378 transitions. Word has length 21 [2020-12-02 22:36:41,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:41,787 INFO L481 AbstractCegarLoop]: Abstraction has 3443 states and 13378 transitions. [2020-12-02 22:36:41,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 22:36:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 13378 transitions. [2020-12-02 22:36:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 22:36:41,789 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:41,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:41,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-02 22:36:41,790 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:41,790 INFO L82 PathProgramCache]: Analyzing trace with hash 820571943, now seen corresponding path program 2 times [2020-12-02 22:36:41,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:41,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954283069] [2020-12-02 22:36:41,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:42,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954283069] [2020-12-02 22:36:42,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:42,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 22:36:42,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047735947] [2020-12-02 22:36:42,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 22:36:42,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:42,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 22:36:42,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:42,013 INFO L87 Difference]: Start difference. First operand 3443 states and 13378 transitions. Second operand 12 states. [2020-12-02 22:36:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:42,560 INFO L93 Difference]: Finished difference Result 4562 states and 17491 transitions. [2020-12-02 22:36:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 22:36:42,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-02 22:36:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:42,571 INFO L225 Difference]: With dead ends: 4562 [2020-12-02 22:36:42,571 INFO L226 Difference]: Without dead ends: 4510 [2020-12-02 22:36:42,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-02 22:36:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2020-12-02 22:36:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 3368. [2020-12-02 22:36:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3368 states. [2020-12-02 22:36:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 12841 transitions. [2020-12-02 22:36:42,667 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 12841 transitions. Word has length 21 [2020-12-02 22:36:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:42,667 INFO L481 AbstractCegarLoop]: Abstraction has 3368 states and 12841 transitions. [2020-12-02 22:36:42,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 22:36:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 12841 transitions. [2020-12-02 22:36:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 22:36:42,669 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:42,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:42,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-02 22:36:42,670 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:42,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:42,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1673753334, now seen corresponding path program 1 times [2020-12-02 22:36:42,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:42,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132371818] [2020-12-02 22:36:42,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:42,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132371818] [2020-12-02 22:36:42,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:42,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 22:36:42,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495655176] [2020-12-02 22:36:42,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 22:36:42,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:42,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 22:36:42,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 22:36:42,735 INFO L87 Difference]: Start difference. First operand 3368 states and 12841 transitions. Second operand 7 states. [2020-12-02 22:36:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:42,840 INFO L93 Difference]: Finished difference Result 3879 states and 14497 transitions. [2020-12-02 22:36:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 22:36:42,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-02 22:36:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:42,848 INFO L225 Difference]: With dead ends: 3879 [2020-12-02 22:36:42,848 INFO L226 Difference]: Without dead ends: 3785 [2020-12-02 22:36:42,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-02 22:36:42,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2020-12-02 22:36:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3369. [2020-12-02 22:36:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3369 states. [2020-12-02 22:36:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 12845 transitions. [2020-12-02 22:36:42,901 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 12845 transitions. Word has length 21 [2020-12-02 22:36:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:42,902 INFO L481 AbstractCegarLoop]: Abstraction has 3369 states and 12845 transitions. [2020-12-02 22:36:42,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 22:36:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 12845 transitions. [2020-12-02 22:36:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 22:36:42,903 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:42,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:42,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-02 22:36:42,904 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:42,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:42,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1208728268, now seen corresponding path program 1 times [2020-12-02 22:36:42,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:42,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303996731] [2020-12-02 22:36:42,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:43,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303996731] [2020-12-02 22:36:43,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:43,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 22:36:43,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060756649] [2020-12-02 22:36:43,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 22:36:43,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:43,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 22:36:43,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-02 22:36:43,141 INFO L87 Difference]: Start difference. First operand 3369 states and 12845 transitions. Second operand 11 states. [2020-12-02 22:36:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:43,973 INFO L93 Difference]: Finished difference Result 4138 states and 15694 transitions. [2020-12-02 22:36:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 22:36:43,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-12-02 22:36:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:43,983 INFO L225 Difference]: With dead ends: 4138 [2020-12-02 22:36:43,983 INFO L226 Difference]: Without dead ends: 4089 [2020-12-02 22:36:43,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-12-02 22:36:43,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2020-12-02 22:36:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 3004. [2020-12-02 22:36:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2020-12-02 22:36:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 11303 transitions. [2020-12-02 22:36:44,047 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 11303 transitions. Word has length 21 [2020-12-02 22:36:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:44,048 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 11303 transitions. [2020-12-02 22:36:44,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 22:36:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 11303 transitions. [2020-12-02 22:36:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 22:36:44,050 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:44,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:44,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-02 22:36:44,051 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:44,051 INFO L82 PathProgramCache]: Analyzing trace with hash 172061386, now seen corresponding path program 2 times [2020-12-02 22:36:44,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:44,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119503501] [2020-12-02 22:36:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:44,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119503501] [2020-12-02 22:36:44,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:44,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 22:36:44,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401029345] [2020-12-02 22:36:44,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 22:36:44,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:44,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 22:36:44,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-02 22:36:44,137 INFO L87 Difference]: Start difference. First operand 3004 states and 11303 transitions. Second operand 8 states. [2020-12-02 22:36:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:44,279 INFO L93 Difference]: Finished difference Result 3058 states and 11357 transitions. [2020-12-02 22:36:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 22:36:44,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-12-02 22:36:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:44,288 INFO L225 Difference]: With dead ends: 3058 [2020-12-02 22:36:44,288 INFO L226 Difference]: Without dead ends: 3058 [2020-12-02 22:36:44,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-02 22:36:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-12-02 22:36:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2831. [2020-12-02 22:36:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-12-02 22:36:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-12-02 22:36:44,358 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-12-02 22:36:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:44,359 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-12-02 22:36:44,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 22:36:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-12-02 22:36:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 22:36:44,362 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:44,362 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:44,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-02 22:36:44,362 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:44,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1320448504, now seen corresponding path program 1 times [2020-12-02 22:36:44,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:44,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046858140] [2020-12-02 22:36:44,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:44,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046858140] [2020-12-02 22:36:44,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:44,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 22:36:44,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192745323] [2020-12-02 22:36:44,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 22:36:44,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 22:36:44,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 22:36:44,480 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2020-12-02 22:36:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:44,784 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2020-12-02 22:36:44,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 22:36:44,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-12-02 22:36:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:44,793 INFO L225 Difference]: With dead ends: 3550 [2020-12-02 22:36:44,793 INFO L226 Difference]: Without dead ends: 3490 [2020-12-02 22:36:44,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-02 22:36:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2020-12-02 22:36:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2020-12-02 22:36:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2020-12-02 22:36:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2020-12-02 22:36:44,845 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2020-12-02 22:36:44,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:44,845 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2020-12-02 22:36:44,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 22:36:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2020-12-02 22:36:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 22:36:44,847 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:44,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:44,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-02 22:36:44,848 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:44,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:44,849 INFO L82 PathProgramCache]: Analyzing trace with hash -893918318, now seen corresponding path program 2 times [2020-12-02 22:36:44,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:44,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181657548] [2020-12-02 22:36:44,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:44,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181657548] [2020-12-02 22:36:44,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:44,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 22:36:44,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453854993] [2020-12-02 22:36:44,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 22:36:44,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:44,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 22:36:44,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-02 22:36:44,972 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2020-12-02 22:36:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:45,375 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2020-12-02 22:36:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 22:36:45,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-12-02 22:36:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:45,388 INFO L225 Difference]: With dead ends: 3862 [2020-12-02 22:36:45,389 INFO L226 Difference]: Without dead ends: 3802 [2020-12-02 22:36:45,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-02 22:36:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2020-12-02 22:36:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2020-12-02 22:36:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-12-02 22:36:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-12-02 22:36:45,466 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-12-02 22:36:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:45,466 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-12-02 22:36:45,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 22:36:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-12-02 22:36:45,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 22:36:45,469 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:45,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:45,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-02 22:36:45,469 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:45,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:45,470 INFO L82 PathProgramCache]: Analyzing trace with hash 131153448, now seen corresponding path program 3 times [2020-12-02 22:36:45,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:45,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2398723] [2020-12-02 22:36:45,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:45,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2398723] [2020-12-02 22:36:45,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:45,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 22:36:45,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645094605] [2020-12-02 22:36:45,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 22:36:45,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 22:36:45,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 22:36:45,579 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2020-12-02 22:36:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:45,966 INFO L93 Difference]: Finished difference Result 4277 states and 15941 transitions. [2020-12-02 22:36:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 22:36:45,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-02 22:36:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:45,978 INFO L225 Difference]: With dead ends: 4277 [2020-12-02 22:36:45,979 INFO L226 Difference]: Without dead ends: 4217 [2020-12-02 22:36:45,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-12-02 22:36:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2020-12-02 22:36:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 2818. [2020-12-02 22:36:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2020-12-02 22:36:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 10596 transitions. [2020-12-02 22:36:46,110 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 10596 transitions. Word has length 22 [2020-12-02 22:36:46,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:46,111 INFO L481 AbstractCegarLoop]: Abstraction has 2818 states and 10596 transitions. [2020-12-02 22:36:46,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 22:36:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 10596 transitions. [2020-12-02 22:36:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 22:36:46,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:46,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:46,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-02 22:36:46,115 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:46,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:46,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1026439080, now seen corresponding path program 4 times [2020-12-02 22:36:46,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:46,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349368878] [2020-12-02 22:36:46,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:46,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349368878] [2020-12-02 22:36:46,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:46,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 22:36:46,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911961357] [2020-12-02 22:36:46,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 22:36:46,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:46,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 22:36:46,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 22:36:46,231 INFO L87 Difference]: Start difference. First operand 2818 states and 10596 transitions. Second operand 10 states. [2020-12-02 22:36:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:46,489 INFO L93 Difference]: Finished difference Result 3433 states and 12660 transitions. [2020-12-02 22:36:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 22:36:46,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-02 22:36:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:46,500 INFO L225 Difference]: With dead ends: 3433 [2020-12-02 22:36:46,501 INFO L226 Difference]: Without dead ends: 3373 [2020-12-02 22:36:46,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-12-02 22:36:46,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2020-12-02 22:36:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 2730. [2020-12-02 22:36:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2020-12-02 22:36:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10232 transitions. [2020-12-02 22:36:46,588 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10232 transitions. Word has length 22 [2020-12-02 22:36:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:46,589 INFO L481 AbstractCegarLoop]: Abstraction has 2730 states and 10232 transitions. [2020-12-02 22:36:46,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 22:36:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10232 transitions. [2020-12-02 22:36:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 22:36:46,592 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:46,592 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:46,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-02 22:36:46,593 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:46,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1544480782, now seen corresponding path program 5 times [2020-12-02 22:36:46,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:46,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335580827] [2020-12-02 22:36:46,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:46,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335580827] [2020-12-02 22:36:46,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:46,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 22:36:46,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284717617] [2020-12-02 22:36:46,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 22:36:46,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:46,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 22:36:46,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:46,839 INFO L87 Difference]: Start difference. First operand 2730 states and 10232 transitions. Second operand 12 states. [2020-12-02 22:36:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:47,270 INFO L93 Difference]: Finished difference Result 3588 states and 13121 transitions. [2020-12-02 22:36:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 22:36:47,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-02 22:36:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:47,280 INFO L225 Difference]: With dead ends: 3588 [2020-12-02 22:36:47,280 INFO L226 Difference]: Without dead ends: 3528 [2020-12-02 22:36:47,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-12-02 22:36:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2020-12-02 22:36:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2670. [2020-12-02 22:36:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-12-02 22:36:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-12-02 22:36:47,337 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-12-02 22:36:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:47,338 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-12-02 22:36:47,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 22:36:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-12-02 22:36:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 22:36:47,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:47,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:47,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-02 22:36:47,340 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:47,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:47,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1499150017, now seen corresponding path program 1 times [2020-12-02 22:36:47,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:47,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181198625] [2020-12-02 22:36:47,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:47,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181198625] [2020-12-02 22:36:47,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:47,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 22:36:47,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804730174] [2020-12-02 22:36:47,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 22:36:47,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:47,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 22:36:47,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:47,658 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-12-02 22:36:48,078 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-12-02 22:36:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:48,536 INFO L93 Difference]: Finished difference Result 2896 states and 10368 transitions. [2020-12-02 22:36:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 22:36:48,536 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-02 22:36:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:48,543 INFO L225 Difference]: With dead ends: 2896 [2020-12-02 22:36:48,543 INFO L226 Difference]: Without dead ends: 2802 [2020-12-02 22:36:48,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2020-12-02 22:36:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2020-12-02 22:36:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2426. [2020-12-02 22:36:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-12-02 22:36:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 8840 transitions. [2020-12-02 22:36:48,582 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 8840 transitions. Word has length 23 [2020-12-02 22:36:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:48,582 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 8840 transitions. [2020-12-02 22:36:48,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 22:36:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 8840 transitions. [2020-12-02 22:36:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 22:36:48,584 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:48,584 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:48,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-02 22:36:48,584 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:48,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:48,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1292151056, now seen corresponding path program 1 times [2020-12-02 22:36:48,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:48,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224950871] [2020-12-02 22:36:48,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:48,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224950871] [2020-12-02 22:36:48,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:48,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 22:36:48,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151093885] [2020-12-02 22:36:48,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 22:36:48,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:48,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 22:36:48,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:48,890 INFO L87 Difference]: Start difference. First operand 2426 states and 8840 transitions. Second operand 12 states. [2020-12-02 22:36:49,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:49,706 INFO L93 Difference]: Finished difference Result 2538 states and 8863 transitions. [2020-12-02 22:36:49,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 22:36:49,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-02 22:36:49,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:49,712 INFO L225 Difference]: With dead ends: 2538 [2020-12-02 22:36:49,712 INFO L226 Difference]: Without dead ends: 2419 [2020-12-02 22:36:49,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-12-02 22:36:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2020-12-02 22:36:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1794. [2020-12-02 22:36:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-12-02 22:36:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-12-02 22:36:49,742 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-12-02 22:36:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:49,742 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-12-02 22:36:49,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 22:36:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-12-02 22:36:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 22:36:49,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:49,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:49,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-02 22:36:49,744 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:49,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:49,744 INFO L82 PathProgramCache]: Analyzing trace with hash -974214744, now seen corresponding path program 1 times [2020-12-02 22:36:49,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:49,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435527978] [2020-12-02 22:36:49,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:49,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435527978] [2020-12-02 22:36:49,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:49,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 22:36:49,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668490428] [2020-12-02 22:36:49,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 22:36:49,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:49,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 22:36:49,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 22:36:49,786 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 6 states. [2020-12-02 22:36:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:49,963 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2020-12-02 22:36:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 22:36:49,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-12-02 22:36:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:49,969 INFO L225 Difference]: With dead ends: 2291 [2020-12-02 22:36:49,969 INFO L226 Difference]: Without dead ends: 2227 [2020-12-02 22:36:49,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 22:36:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2020-12-02 22:36:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2020-12-02 22:36:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-12-02 22:36:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-12-02 22:36:49,999 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-12-02 22:36:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:49,999 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-12-02 22:36:49,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 22:36:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-12-02 22:36:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 22:36:50,001 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:50,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:50,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-02 22:36:50,001 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:50,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:50,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1120972762, now seen corresponding path program 2 times [2020-12-02 22:36:50,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:50,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408609510] [2020-12-02 22:36:50,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:50,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408609510] [2020-12-02 22:36:50,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:50,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 22:36:50,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544751851] [2020-12-02 22:36:50,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 22:36:50,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:50,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 22:36:50,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 22:36:50,084 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 8 states. [2020-12-02 22:36:50,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:50,429 INFO L93 Difference]: Finished difference Result 2599 states and 8709 transitions. [2020-12-02 22:36:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 22:36:50,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-02 22:36:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:50,434 INFO L225 Difference]: With dead ends: 2599 [2020-12-02 22:36:50,435 INFO L226 Difference]: Without dead ends: 2535 [2020-12-02 22:36:50,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-02 22:36:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2020-12-02 22:36:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2102. [2020-12-02 22:36:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-12-02 22:36:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7273 transitions. [2020-12-02 22:36:50,466 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7273 transitions. Word has length 24 [2020-12-02 22:36:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:50,466 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7273 transitions. [2020-12-02 22:36:50,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 22:36:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7273 transitions. [2020-12-02 22:36:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 22:36:50,468 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:50,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:50,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-02 22:36:50,468 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:50,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1176290112, now seen corresponding path program 3 times [2020-12-02 22:36:50,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:50,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052441074] [2020-12-02 22:36:50,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:50,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052441074] [2020-12-02 22:36:50,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:50,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 22:36:50,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994162419] [2020-12-02 22:36:50,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 22:36:50,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:50,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 22:36:50,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-02 22:36:50,583 INFO L87 Difference]: Start difference. First operand 2102 states and 7273 transitions. Second operand 9 states. [2020-12-02 22:36:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:50,984 INFO L93 Difference]: Finished difference Result 2898 states and 9677 transitions. [2020-12-02 22:36:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 22:36:50,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-12-02 22:36:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:50,991 INFO L225 Difference]: With dead ends: 2898 [2020-12-02 22:36:50,992 INFO L226 Difference]: Without dead ends: 2834 [2020-12-02 22:36:50,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-02 22:36:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2020-12-02 22:36:51,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2093. [2020-12-02 22:36:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-12-02 22:36:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2020-12-02 22:36:51,025 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2020-12-02 22:36:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:51,025 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2020-12-02 22:36:51,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 22:36:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2020-12-02 22:36:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 22:36:51,027 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:51,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:51,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-02 22:36:51,027 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:51,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1572220842, now seen corresponding path program 4 times [2020-12-02 22:36:51,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:51,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232170548] [2020-12-02 22:36:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:51,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232170548] [2020-12-02 22:36:51,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:51,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 22:36:51,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352677946] [2020-12-02 22:36:51,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 22:36:51,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:51,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 22:36:51,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-02 22:36:51,172 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 10 states. [2020-12-02 22:36:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:51,582 INFO L93 Difference]: Finished difference Result 2875 states and 9618 transitions. [2020-12-02 22:36:51,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 22:36:51,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-12-02 22:36:51,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:51,608 INFO L225 Difference]: With dead ends: 2875 [2020-12-02 22:36:51,609 INFO L226 Difference]: Without dead ends: 2811 [2020-12-02 22:36:51,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-12-02 22:36:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2020-12-02 22:36:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2079. [2020-12-02 22:36:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2020-12-02 22:36:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 7214 transitions. [2020-12-02 22:36:51,652 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 7214 transitions. Word has length 24 [2020-12-02 22:36:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:51,653 INFO L481 AbstractCegarLoop]: Abstraction has 2079 states and 7214 transitions. [2020-12-02 22:36:51,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 22:36:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 7214 transitions. [2020-12-02 22:36:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 22:36:51,656 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:51,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:51,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-02 22:36:51,656 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash 438749216, now seen corresponding path program 5 times [2020-12-02 22:36:51,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:51,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350054384] [2020-12-02 22:36:51,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:51,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350054384] [2020-12-02 22:36:51,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:51,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 22:36:51,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071879014] [2020-12-02 22:36:51,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 22:36:51,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:51,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 22:36:51,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-02 22:36:51,808 INFO L87 Difference]: Start difference. First operand 2079 states and 7214 transitions. Second operand 11 states. [2020-12-02 22:36:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:52,137 INFO L93 Difference]: Finished difference Result 3106 states and 10587 transitions. [2020-12-02 22:36:52,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 22:36:52,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-02 22:36:52,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:52,146 INFO L225 Difference]: With dead ends: 3106 [2020-12-02 22:36:52,146 INFO L226 Difference]: Without dead ends: 3042 [2020-12-02 22:36:52,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-12-02 22:36:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2020-12-02 22:36:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2071. [2020-12-02 22:36:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-12-02 22:36:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7186 transitions. [2020-12-02 22:36:52,198 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7186 transitions. Word has length 24 [2020-12-02 22:36:52,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:52,199 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 7186 transitions. [2020-12-02 22:36:52,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 22:36:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7186 transitions. [2020-12-02 22:36:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 22:36:52,202 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:52,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:52,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-02 22:36:52,202 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:52,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash 991769996, now seen corresponding path program 6 times [2020-12-02 22:36:52,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:52,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272896840] [2020-12-02 22:36:52,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:52,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272896840] [2020-12-02 22:36:52,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:52,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 22:36:52,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061202178] [2020-12-02 22:36:52,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 22:36:52,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:52,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 22:36:52,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-02 22:36:52,332 INFO L87 Difference]: Start difference. First operand 2071 states and 7186 transitions. Second operand 11 states. [2020-12-02 22:36:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:52,627 INFO L93 Difference]: Finished difference Result 2481 states and 8355 transitions. [2020-12-02 22:36:52,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 22:36:52,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-02 22:36:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:52,635 INFO L225 Difference]: With dead ends: 2481 [2020-12-02 22:36:52,636 INFO L226 Difference]: Without dead ends: 2417 [2020-12-02 22:36:52,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2020-12-02 22:36:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2020-12-02 22:36:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2039. [2020-12-02 22:36:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2020-12-02 22:36:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 7058 transitions. [2020-12-02 22:36:52,682 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 7058 transitions. Word has length 24 [2020-12-02 22:36:52,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:52,683 INFO L481 AbstractCegarLoop]: Abstraction has 2039 states and 7058 transitions. [2020-12-02 22:36:52,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 22:36:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 7058 transitions. [2020-12-02 22:36:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 22:36:52,686 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:52,686 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:52,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-02 22:36:52,686 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:52,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:52,687 INFO L82 PathProgramCache]: Analyzing trace with hash 71780478, now seen corresponding path program 7 times [2020-12-02 22:36:52,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:52,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584283580] [2020-12-02 22:36:52,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:52,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584283580] [2020-12-02 22:36:52,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:52,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-02 22:36:52,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130050041] [2020-12-02 22:36:52,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-02 22:36:52,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:52,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-02 22:36:52,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-12-02 22:36:52,949 INFO L87 Difference]: Start difference. First operand 2039 states and 7058 transitions. Second operand 13 states. [2020-12-02 22:36:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:53,918 INFO L93 Difference]: Finished difference Result 3018 states and 10169 transitions. [2020-12-02 22:36:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 22:36:53,919 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-12-02 22:36:53,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:53,926 INFO L225 Difference]: With dead ends: 3018 [2020-12-02 22:36:53,926 INFO L226 Difference]: Without dead ends: 2890 [2020-12-02 22:36:53,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-02 22:36:53,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-12-02 22:36:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1971. [2020-12-02 22:36:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2020-12-02 22:36:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 6882 transitions. [2020-12-02 22:36:53,960 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 6882 transitions. Word has length 24 [2020-12-02 22:36:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:53,960 INFO L481 AbstractCegarLoop]: Abstraction has 1971 states and 6882 transitions. [2020-12-02 22:36:53,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-02 22:36:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 6882 transitions. [2020-12-02 22:36:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 22:36:53,962 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:53,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:53,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-02 22:36:53,962 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1318319474, now seen corresponding path program 1 times [2020-12-02 22:36:53,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:53,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118390503] [2020-12-02 22:36:53,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:54,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118390503] [2020-12-02 22:36:54,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:54,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 22:36:54,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734147644] [2020-12-02 22:36:54,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 22:36:54,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:54,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 22:36:54,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:54,186 INFO L87 Difference]: Start difference. First operand 1971 states and 6882 transitions. Second operand 12 states. [2020-12-02 22:36:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:54,581 INFO L93 Difference]: Finished difference Result 3157 states and 10632 transitions. [2020-12-02 22:36:54,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 22:36:54,582 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-12-02 22:36:54,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:54,589 INFO L225 Difference]: With dead ends: 3157 [2020-12-02 22:36:54,589 INFO L226 Difference]: Without dead ends: 3133 [2020-12-02 22:36:54,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-02 22:36:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2020-12-02 22:36:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 1613. [2020-12-02 22:36:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2020-12-02 22:36:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2020-12-02 22:36:54,621 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 24 [2020-12-02 22:36:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:54,621 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2020-12-02 22:36:54,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 22:36:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2020-12-02 22:36:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 22:36:54,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:54,625 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:54,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-02 22:36:54,625 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:54,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:54,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1290250801, now seen corresponding path program 1 times [2020-12-02 22:36:54,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:54,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660127425] [2020-12-02 22:36:54,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:54,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:54,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660127425] [2020-12-02 22:36:54,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:54,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 22:36:54,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50215922] [2020-12-02 22:36:54,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 22:36:54,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:54,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 22:36:54,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:54,841 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 12 states. [2020-12-02 22:36:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:55,467 INFO L93 Difference]: Finished difference Result 2298 states and 7608 transitions. [2020-12-02 22:36:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 22:36:55,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-02 22:36:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:55,472 INFO L225 Difference]: With dead ends: 2298 [2020-12-02 22:36:55,472 INFO L226 Difference]: Without dead ends: 2254 [2020-12-02 22:36:55,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2020-12-02 22:36:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2020-12-02 22:36:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1611. [2020-12-02 22:36:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2020-12-02 22:36:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 5567 transitions. [2020-12-02 22:36:55,510 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 5567 transitions. Word has length 26 [2020-12-02 22:36:55,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:55,511 INFO L481 AbstractCegarLoop]: Abstraction has 1611 states and 5567 transitions. [2020-12-02 22:36:55,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 22:36:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 5567 transitions. [2020-12-02 22:36:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 22:36:55,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:55,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:55,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-02 22:36:55,514 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash -943856693, now seen corresponding path program 2 times [2020-12-02 22:36:55,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:55,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677742135] [2020-12-02 22:36:55,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:55,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677742135] [2020-12-02 22:36:55,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:55,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 22:36:55,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745009924] [2020-12-02 22:36:55,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 22:36:55,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:55,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 22:36:55,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:55,706 INFO L87 Difference]: Start difference. First operand 1611 states and 5567 transitions. Second operand 12 states. [2020-12-02 22:36:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:56,138 INFO L93 Difference]: Finished difference Result 2242 states and 7477 transitions. [2020-12-02 22:36:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 22:36:56,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-02 22:36:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:56,143 INFO L225 Difference]: With dead ends: 2242 [2020-12-02 22:36:56,143 INFO L226 Difference]: Without dead ends: 2198 [2020-12-02 22:36:56,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-02 22:36:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2020-12-02 22:36:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1587. [2020-12-02 22:36:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-12-02 22:36:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 5509 transitions. [2020-12-02 22:36:56,170 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 5509 transitions. Word has length 26 [2020-12-02 22:36:56,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:56,170 INFO L481 AbstractCegarLoop]: Abstraction has 1587 states and 5509 transitions. [2020-12-02 22:36:56,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 22:36:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 5509 transitions. [2020-12-02 22:36:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 22:36:56,172 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:56,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:56,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-02 22:36:56,173 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:56,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash -390835913, now seen corresponding path program 3 times [2020-12-02 22:36:56,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:56,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112597155] [2020-12-02 22:36:56,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:56,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112597155] [2020-12-02 22:36:56,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:56,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 22:36:56,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578836780] [2020-12-02 22:36:56,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 22:36:56,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:56,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 22:36:56,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:56,364 INFO L87 Difference]: Start difference. First operand 1587 states and 5509 transitions. Second operand 12 states. [2020-12-02 22:36:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:56,761 INFO L93 Difference]: Finished difference Result 1640 states and 5473 transitions. [2020-12-02 22:36:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 22:36:56,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-02 22:36:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:56,765 INFO L225 Difference]: With dead ends: 1640 [2020-12-02 22:36:56,765 INFO L226 Difference]: Without dead ends: 1596 [2020-12-02 22:36:56,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-02 22:36:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2020-12-02 22:36:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 885. [2020-12-02 22:36:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-02 22:36:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-12-02 22:36:56,782 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-12-02 22:36:56,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:56,783 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-12-02 22:36:56,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 22:36:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-12-02 22:36:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 22:36:56,784 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:56,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:56,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-02 22:36:56,785 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:56,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:56,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1977826857, now seen corresponding path program 1 times [2020-12-02 22:36:56,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:56,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332440275] [2020-12-02 22:36:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:56,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332440275] [2020-12-02 22:36:56,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:56,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 22:36:56,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996240922] [2020-12-02 22:36:56,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 22:36:56,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:56,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 22:36:56,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 22:36:56,913 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-12-02 22:36:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:57,109 INFO L93 Difference]: Finished difference Result 885 states and 3021 transitions. [2020-12-02 22:36:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 22:36:57,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-02 22:36:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:57,124 INFO L225 Difference]: With dead ends: 885 [2020-12-02 22:36:57,124 INFO L226 Difference]: Without dead ends: 885 [2020-12-02 22:36:57,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2020-12-02 22:36:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2020-12-02 22:36:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-02 22:36:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3021 transitions. [2020-12-02 22:36:57,138 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3021 transitions. Word has length 41 [2020-12-02 22:36:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:57,139 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3021 transitions. [2020-12-02 22:36:57,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 22:36:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3021 transitions. [2020-12-02 22:36:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 22:36:57,141 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:57,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:57,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-02 22:36:57,141 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:57,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:57,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1154622732, now seen corresponding path program 1 times [2020-12-02 22:36:57,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:57,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001692362] [2020-12-02 22:36:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:57,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001692362] [2020-12-02 22:36:57,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:57,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 22:36:57,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765700051] [2020-12-02 22:36:57,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 22:36:57,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:57,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 22:36:57,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-02 22:36:57,223 INFO L87 Difference]: Start difference. First operand 885 states and 3021 transitions. Second operand 7 states. [2020-12-02 22:36:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:57,369 INFO L93 Difference]: Finished difference Result 885 states and 3017 transitions. [2020-12-02 22:36:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 22:36:57,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-02 22:36:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:57,371 INFO L225 Difference]: With dead ends: 885 [2020-12-02 22:36:57,372 INFO L226 Difference]: Without dead ends: 741 [2020-12-02 22:36:57,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-02 22:36:57,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-02 22:36:57,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-02 22:36:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-02 22:36:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2489 transitions. [2020-12-02 22:36:57,388 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2489 transitions. Word has length 41 [2020-12-02 22:36:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:57,389 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2489 transitions. [2020-12-02 22:36:57,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 22:36:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2489 transitions. [2020-12-02 22:36:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 22:36:57,391 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:57,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:57,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-02 22:36:57,392 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:57,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:57,393 INFO L82 PathProgramCache]: Analyzing trace with hash -267308717, now seen corresponding path program 1 times [2020-12-02 22:36:57,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:57,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840066128] [2020-12-02 22:36:57,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:57,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840066128] [2020-12-02 22:36:57,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:57,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 22:36:57,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33248553] [2020-12-02 22:36:57,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 22:36:57,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:57,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 22:36:57,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 22:36:57,527 INFO L87 Difference]: Start difference. First operand 741 states and 2489 transitions. Second operand 8 states. [2020-12-02 22:36:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:57,723 INFO L93 Difference]: Finished difference Result 741 states and 2481 transitions. [2020-12-02 22:36:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 22:36:57,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-02 22:36:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:57,726 INFO L225 Difference]: With dead ends: 741 [2020-12-02 22:36:57,726 INFO L226 Difference]: Without dead ends: 741 [2020-12-02 22:36:57,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-02 22:36:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-02 22:36:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-02 22:36:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-02 22:36:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2481 transitions. [2020-12-02 22:36:57,741 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2481 transitions. Word has length 41 [2020-12-02 22:36:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:57,742 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2481 transitions. [2020-12-02 22:36:57,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 22:36:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2481 transitions. [2020-12-02 22:36:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 22:36:57,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:57,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:57,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-02 22:36:57,744 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1194300753, now seen corresponding path program 1 times [2020-12-02 22:36:57,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:57,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146282702] [2020-12-02 22:36:57,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 22:36:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 22:36:57,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146282702] [2020-12-02 22:36:57,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 22:36:57,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 22:36:57,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488939153] [2020-12-02 22:36:57,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 22:36:57,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 22:36:57,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 22:36:57,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-02 22:36:57,824 INFO L87 Difference]: Start difference. First operand 741 states and 2481 transitions. Second operand 7 states. [2020-12-02 22:36:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 22:36:57,937 INFO L93 Difference]: Finished difference Result 741 states and 2477 transitions. [2020-12-02 22:36:57,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 22:36:57,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-02 22:36:57,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 22:36:57,940 INFO L225 Difference]: With dead ends: 741 [2020-12-02 22:36:57,940 INFO L226 Difference]: Without dead ends: 495 [2020-12-02 22:36:57,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-02 22:36:57,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-12-02 22:36:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2020-12-02 22:36:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2020-12-02 22:36:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1606 transitions. [2020-12-02 22:36:57,952 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1606 transitions. Word has length 41 [2020-12-02 22:36:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 22:36:57,953 INFO L481 AbstractCegarLoop]: Abstraction has 495 states and 1606 transitions. [2020-12-02 22:36:57,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 22:36:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1606 transitions. [2020-12-02 22:36:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 22:36:57,955 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 22:36:57,955 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 22:36:57,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-02 22:36:57,956 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-02 22:36:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 22:36:57,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1766059350, now seen corresponding path program 1 times [2020-12-02 22:36:57,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 22:36:57,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484411328] [2020-12-02 22:36:57,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 22:36:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 22:36:57,976 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 22:36:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 22:36:58,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 22:36:58,071 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 22:36:58,072 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 22:36:58,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-02 22:36:58,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:36:58 BasicIcfg [2020-12-02 22:36:58,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 22:36:58,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 22:36:58,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 22:36:58,225 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 22:36:58,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:36:15" (3/4) ... [2020-12-02 22:36:58,227 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 22:36:58,365 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 22:36:58,365 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 22:36:58,366 INFO L168 Benchmark]: Toolchain (without parser) took 44304.27 ms. Allocated memory was 44.0 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 26.8 MB in the beginning and 1.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 424.6 MB. Max. memory is 16.1 GB. [2020-12-02 22:36:58,367 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 35.7 MB. Free memory was 22.8 MB in the beginning and 22.8 MB in the end (delta: 22.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 22:36:58,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1040.45 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 26.6 MB in the beginning and 32.7 MB in the end (delta: -6.1 MB). Peak memory consumption was 23.7 MB. Max. memory is 16.1 GB. [2020-12-02 22:36:58,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.17 ms. Allocated memory is still 56.6 MB. Free memory was 32.7 MB in the beginning and 30.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 22:36:58,368 INFO L168 Benchmark]: Boogie Preprocessor took 43.95 ms. Allocated memory is still 56.6 MB. Free memory was 30.6 MB in the beginning and 29.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 22:36:58,368 INFO L168 Benchmark]: RCFGBuilder took 659.02 ms. Allocated memory is still 56.6 MB. Free memory was 28.9 MB in the beginning and 21.9 MB in the end (delta: 7.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. [2020-12-02 22:36:58,369 INFO L168 Benchmark]: TraceAbstraction took 42341.47 ms. Allocated memory was 56.6 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 21.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 383.1 MB. Max. memory is 16.1 GB. [2020-12-02 22:36:58,369 INFO L168 Benchmark]: Witness Printer took 140.82 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-02 22:36:58,373 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.54 ms. Allocated memory is still 35.7 MB. Free memory was 22.8 MB in the beginning and 22.8 MB in the end (delta: 22.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1040.45 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 26.6 MB in the beginning and 32.7 MB in the end (delta: -6.1 MB). Peak memory consumption was 23.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.17 ms. Allocated memory is still 56.6 MB. Free memory was 32.7 MB in the beginning and 30.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.95 ms. Allocated memory is still 56.6 MB. Free memory was 30.6 MB in the beginning and 29.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 659.02 ms. Allocated memory is still 56.6 MB. Free memory was 28.9 MB in the beginning and 21.9 MB in the end (delta: 7.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 42341.47 ms. Allocated memory was 56.6 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 21.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 383.1 MB. Max. memory is 16.1 GB. * Witness Printer took 140.82 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 3374 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.3s, 1145 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.5s, 167 PlacesBefore, 93 PlacesAfterwards, 248 TransitionsBefore, 173 TransitionsAfterwards, 4156 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 49018 MoverChecksTotal - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; [L1163] 0 \read(t) VAL [arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1133] 5 v[0] = 'X' [L1135] 5 return 0; [L1133] 3 v[0] = 'X' [L1135] 3 return 0; [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1153] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1154] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1133] 6 v[0] = 'X' [L1135] 6 return 0; [L1140] 4 v[0] = 'Y' [L1142] 4 return 0; [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1155] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1156] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] [L1164] 0 v[0] [L1123] COND TRUE 0 !expression [L1123] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 41.7s, OverallIterations: 53, TraceHistogramMax: 1, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 5380 SDtfs, 11076 SDslu, 16167 SDs, 0 SdLazy, 10055 SolverSat, 1668 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 60 SyntacticMatches, 18 SemanticMatches, 625 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4305occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 52 MinimizatonAttempts, 47589 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1193 NumberOfCodeBlocks, 1193 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1100 ConstructedInterpolants, 0 QuantifiedInterpolants, 426321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 52 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...