./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 3c39aff9 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3491af59218a0433b9de95fff59451438a5c03e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1.24-3c39aff [2019-11-27 18:46:13,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:46:13,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:46:13,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:46:13,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:46:13,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:46:13,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:46:13,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:46:13,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:46:13,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:46:13,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:46:13,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:46:13,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:46:13,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:46:13,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:46:13,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:46:13,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:46:13,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:46:13,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:46:13,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:46:13,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:46:13,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:46:13,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:46:13,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:46:13,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:46:13,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:46:13,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:46:13,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:46:13,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:46:13,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:46:13,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:46:13,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:46:13,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:46:13,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:46:13,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:46:13,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:46:13,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:46:13,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:46:13,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:46:13,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:46:13,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:46:13,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 18:46:13,449 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:46:13,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:46:13,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:46:13,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:46:13,451 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:46:13,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:46:13,452 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:46:13,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:46:13,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:46:13,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:46:13,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 18:46:13,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:46:13,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 18:46:13,454 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:46:13,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 18:46:13,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:46:13,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 18:46:13,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:46:13,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:46:13,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:46:13,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:46:13,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:46:13,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:46:13,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:46:13,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 18:46:13,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 18:46:13,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 18:46:13,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 18:46:13,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> f3491af59218a0433b9de95fff59451438a5c03e [2019-11-27 18:46:13,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:46:13,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:46:13,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:46:13,790 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:46:13,790 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:46:13,791 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton.i [2019-11-27 18:46:13,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca6bbc31/b758e571517f431baa64af7ec676a3e6/FLAG744896387 [2019-11-27 18:46:14,395 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:46:14,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i [2019-11-27 18:46:14,416 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca6bbc31/b758e571517f431baa64af7ec676a3e6/FLAG744896387 [2019-11-27 18:46:14,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca6bbc31/b758e571517f431baa64af7ec676a3e6 [2019-11-27 18:46:14,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:46:14,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 18:46:14,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:46:14,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:46:14,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:46:14,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:46:14" (1/1) ... [2019-11-27 18:46:14,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3298c3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:14, skipping insertion in model container [2019-11-27 18:46:14,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:46:14" (1/1) ... [2019-11-27 18:46:14,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:46:14,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:46:15,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:46:15,398 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 18:46:15,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:46:15,661 INFO L208 MainTranslator]: Completed translation [2019-11-27 18:46:15,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:15 WrapperNode [2019-11-27 18:46:15,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:46:15,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 18:46:15,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 18:46:15,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 18:46:15,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:15" (1/1) ... [2019-11-27 18:46:15,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:15" (1/1) ... [2019-11-27 18:46:15,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 18:46:15,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 18:46:15,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 18:46:15,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 18:46:15,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:15" (1/1) ... [2019-11-27 18:46:15,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:15" (1/1) ... [2019-11-27 18:46:15,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:15" (1/1) ... [2019-11-27 18:46:15,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:15" (1/1) ... [2019-11-27 18:46:15,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:15" (1/1) ... [2019-11-27 18:46:15,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:15" (1/1) ... [2019-11-27 18:46:15,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:15" (1/1) ... [2019-11-27 18:46:15,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 18:46:15,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 18:46:15,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 18:46:15,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 18:46:15,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46: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 [2019-11-27 18:46:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 18:46:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 18:46:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 18:46:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2019-11-27 18:46:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2019-11-27 18:46:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-11-27 18:46:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-11-27 18:46:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-11-27 18:46:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-11-27 18:46:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-11-27 18:46:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-11-27 18:46:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 18:46:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 18:46:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 18:46:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 18:46:15,891 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-27 18:46:16,338 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 18:46:16,339 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-27 18:46:16,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:46:16 BoogieIcfgContainer [2019-11-27 18:46:16,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 18:46:16,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 18:46:16,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 18:46:16,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 18:46:16,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 06:46:14" (1/3) ... [2019-11-27 18:46:16,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2662cf08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:46:16, skipping insertion in model container [2019-11-27 18:46:16,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:46:15" (2/3) ... [2019-11-27 18:46:16,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2662cf08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:46:16, skipping insertion in model container [2019-11-27 18:46:16,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:46:16" (3/3) ... [2019-11-27 18:46:16,350 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2019-11-27 18:46:16,361 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-27 18:46:16,361 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 18:46:16,370 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 18:46:16,371 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-27 18:46:16,411 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,411 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,411 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,412 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,412 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,412 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,413 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,413 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,414 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,414 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,414 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,415 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,415 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,416 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,416 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,416 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,417 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,417 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,417 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,418 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,419 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,419 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,419 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,420 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,420 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,420 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,421 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,421 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,421 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,422 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,422 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,422 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,423 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,423 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,423 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,423 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,424 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,424 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,425 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,425 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,425 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,426 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,426 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,426 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,427 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,427 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,427 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,428 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,428 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,428 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,429 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,429 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,429 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,430 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,430 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,430 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,431 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,431 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,431 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,431 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,432 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,432 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,432 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,433 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,433 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,433 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,434 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,434 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,434 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,435 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,435 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,435 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,436 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,436 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,436 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,436 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,437 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,437 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,438 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,438 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,438 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,439 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,439 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,439 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,440 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,440 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,440 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,441 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,441 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,441 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,442 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,442 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,442 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,442 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,443 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,443 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,444 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,444 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,444 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,445 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-27 18:46:16,697 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-11-27 18:46:16,720 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 18:46:16,720 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 18:46:16,720 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 18:46:16,720 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 18:46:16,729 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 18:46:16,729 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 18:46:16,729 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 18:46:16,730 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 18:46:16,756 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 172 places, 243 transitions [2019-11-27 18:46:22,647 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47313 states. [2019-11-27 18:46:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 47313 states. [2019-11-27 18:46:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 18:46:22,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:22,661 INFO L410 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] [2019-11-27 18:46:22,661 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash -386252412, now seen corresponding path program 1 times [2019-11-27 18:46:22,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:22,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650754226] [2019-11-27 18:46:22,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:23,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650754226] [2019-11-27 18:46:23,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:23,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 18:46:23,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515808648] [2019-11-27 18:46:23,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:46:23,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:23,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:46:23,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:46:23,035 INFO L87 Difference]: Start difference. First operand 47313 states. Second operand 5 states. [2019-11-27 18:46:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:24,232 INFO L93 Difference]: Finished difference Result 53971 states and 232572 transitions. [2019-11-27 18:46:24,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:46:24,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-27 18:46:24,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:25,015 INFO L225 Difference]: With dead ends: 53971 [2019-11-27 18:46:25,015 INFO L226 Difference]: Without dead ends: 38046 [2019-11-27 18:46:25,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:46:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38046 states. [2019-11-27 18:46:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38046 to 31407. [2019-11-27 18:46:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31407 states. [2019-11-27 18:46:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31407 states to 31407 states and 135821 transitions. [2019-11-27 18:46:26,589 INFO L78 Accepts]: Start accepts. Automaton has 31407 states and 135821 transitions. Word has length 32 [2019-11-27 18:46:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:26,590 INFO L462 AbstractCegarLoop]: Abstraction has 31407 states and 135821 transitions. [2019-11-27 18:46:26,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:46:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 31407 states and 135821 transitions. [2019-11-27 18:46:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 18:46:26,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:26,593 INFO L410 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] [2019-11-27 18:46:26,593 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:26,594 INFO L82 PathProgramCache]: Analyzing trace with hash -759214558, now seen corresponding path program 2 times [2019-11-27 18:46:26,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:26,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036998362] [2019-11-27 18:46:26,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:26,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036998362] [2019-11-27 18:46:26,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:26,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 18:46:26,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308320447] [2019-11-27 18:46:26,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:46:26,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:26,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:46:26,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:46:26,830 INFO L87 Difference]: Start difference. First operand 31407 states and 135821 transitions. Second operand 8 states. [2019-11-27 18:46:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:28,030 INFO L93 Difference]: Finished difference Result 38064 states and 167102 transitions. [2019-11-27 18:46:28,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 18:46:28,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-11-27 18:46:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:28,229 INFO L225 Difference]: With dead ends: 38064 [2019-11-27 18:46:28,230 INFO L226 Difference]: Without dead ends: 38064 [2019-11-27 18:46:28,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:46:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38064 states. [2019-11-27 18:46:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38064 to 31407. [2019-11-27 18:46:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31407 states. [2019-11-27 18:46:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31407 states to 31407 states and 135821 transitions. [2019-11-27 18:46:29,518 INFO L78 Accepts]: Start accepts. Automaton has 31407 states and 135821 transitions. Word has length 32 [2019-11-27 18:46:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:29,519 INFO L462 AbstractCegarLoop]: Abstraction has 31407 states and 135821 transitions. [2019-11-27 18:46:29,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:46:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 31407 states and 135821 transitions. [2019-11-27 18:46:29,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 18:46:29,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:29,522 INFO L410 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] [2019-11-27 18:46:29,522 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:29,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:29,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1996224320, now seen corresponding path program 3 times [2019-11-27 18:46:29,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:29,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284419707] [2019-11-27 18:46:29,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:29,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284419707] [2019-11-27 18:46:29,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:29,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 18:46:29,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705047799] [2019-11-27 18:46:29,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:46:29,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:29,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:46:29,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:46:29,630 INFO L87 Difference]: Start difference. First operand 31407 states and 135821 transitions. Second operand 8 states. [2019-11-27 18:46:30,252 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-11-27 18:46:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:30,807 INFO L93 Difference]: Finished difference Result 44677 states and 198309 transitions. [2019-11-27 18:46:30,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 18:46:30,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-11-27 18:46:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:31,028 INFO L225 Difference]: With dead ends: 44677 [2019-11-27 18:46:31,028 INFO L226 Difference]: Without dead ends: 44677 [2019-11-27 18:46:31,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-27 18:46:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44677 states. [2019-11-27 18:46:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44677 to 31364. [2019-11-27 18:46:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31364 states. [2019-11-27 18:46:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31364 states to 31364 states and 135748 transitions. [2019-11-27 18:46:32,063 INFO L78 Accepts]: Start accepts. Automaton has 31364 states and 135748 transitions. Word has length 32 [2019-11-27 18:46:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:32,063 INFO L462 AbstractCegarLoop]: Abstraction has 31364 states and 135748 transitions. [2019-11-27 18:46:32,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:46:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 31364 states and 135748 transitions. [2019-11-27 18:46:32,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-27 18:46:32,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:32,072 INFO L410 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, 1] [2019-11-27 18:46:32,072 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:32,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash -573780194, now seen corresponding path program 1 times [2019-11-27 18:46:32,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:32,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362629092] [2019-11-27 18:46:32,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:32,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362629092] [2019-11-27 18:46:32,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:32,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 18:46:32,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954634667] [2019-11-27 18:46:32,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:46:32,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:32,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:46:32,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:46:32,142 INFO L87 Difference]: Start difference. First operand 31364 states and 135748 transitions. Second operand 5 states. [2019-11-27 18:46:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:32,494 INFO L93 Difference]: Finished difference Result 37554 states and 163555 transitions. [2019-11-27 18:46:32,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:46:32,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-27 18:46:32,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:32,645 INFO L225 Difference]: With dead ends: 37554 [2019-11-27 18:46:32,645 INFO L226 Difference]: Without dead ends: 37554 [2019-11-27 18:46:32,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:46:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2019-11-27 18:46:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 35091. [2019-11-27 18:46:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35091 states. [2019-11-27 18:46:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35091 states to 35091 states and 153592 transitions. [2019-11-27 18:46:34,104 INFO L78 Accepts]: Start accepts. Automaton has 35091 states and 153592 transitions. Word has length 42 [2019-11-27 18:46:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:34,104 INFO L462 AbstractCegarLoop]: Abstraction has 35091 states and 153592 transitions. [2019-11-27 18:46:34,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:46:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 35091 states and 153592 transitions. [2019-11-27 18:46:34,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-27 18:46:34,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:34,110 INFO L410 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, 1] [2019-11-27 18:46:34,110 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:34,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash 40373214, now seen corresponding path program 2 times [2019-11-27 18:46:34,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:34,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435216995] [2019-11-27 18:46:34,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:34,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435216995] [2019-11-27 18:46:34,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:34,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 18:46:34,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786108167] [2019-11-27 18:46:34,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 18:46:34,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:34,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 18:46:34,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 18:46:34,190 INFO L87 Difference]: Start difference. First operand 35091 states and 153592 transitions. Second operand 6 states. [2019-11-27 18:46:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:34,824 INFO L93 Difference]: Finished difference Result 74226 states and 316463 transitions. [2019-11-27 18:46:34,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 18:46:34,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-27 18:46:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:34,981 INFO L225 Difference]: With dead ends: 74226 [2019-11-27 18:46:34,981 INFO L226 Difference]: Without dead ends: 46039 [2019-11-27 18:46:34,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:46:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46039 states. [2019-11-27 18:46:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46039 to 35488. [2019-11-27 18:46:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35488 states. [2019-11-27 18:46:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35488 states to 35488 states and 149278 transitions. [2019-11-27 18:46:36,439 INFO L78 Accepts]: Start accepts. Automaton has 35488 states and 149278 transitions. Word has length 42 [2019-11-27 18:46:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:36,440 INFO L462 AbstractCegarLoop]: Abstraction has 35488 states and 149278 transitions. [2019-11-27 18:46:36,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 18:46:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 35488 states and 149278 transitions. [2019-11-27 18:46:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 18:46:36,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:36,455 INFO L410 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, 1, 1, 1] [2019-11-27 18:46:36,455 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:36,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash 210281631, now seen corresponding path program 1 times [2019-11-27 18:46:36,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:36,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473863827] [2019-11-27 18:46:36,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:36,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473863827] [2019-11-27 18:46:36,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:36,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 18:46:36,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014805034] [2019-11-27 18:46:36,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:46:36,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:36,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:46:36,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:46:36,573 INFO L87 Difference]: Start difference. First operand 35488 states and 149278 transitions. Second operand 8 states. [2019-11-27 18:46:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:37,120 INFO L93 Difference]: Finished difference Result 42306 states and 178056 transitions. [2019-11-27 18:46:37,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:46:37,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-11-27 18:46:37,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:37,220 INFO L225 Difference]: With dead ends: 42306 [2019-11-27 18:46:37,220 INFO L226 Difference]: Without dead ends: 42234 [2019-11-27 18:46:37,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:46:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42234 states. [2019-11-27 18:46:37,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42234 to 35467. [2019-11-27 18:46:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35467 states. [2019-11-27 18:46:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35467 states to 35467 states and 149246 transitions. [2019-11-27 18:46:37,946 INFO L78 Accepts]: Start accepts. Automaton has 35467 states and 149246 transitions. Word has length 44 [2019-11-27 18:46:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:37,946 INFO L462 AbstractCegarLoop]: Abstraction has 35467 states and 149246 transitions. [2019-11-27 18:46:37,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:46:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 35467 states and 149246 transitions. [2019-11-27 18:46:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 18:46:37,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:37,958 INFO L410 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, 1, 1, 1] [2019-11-27 18:46:37,958 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:37,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:37,959 INFO L82 PathProgramCache]: Analyzing trace with hash 819066901, now seen corresponding path program 2 times [2019-11-27 18:46:37,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:37,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78080786] [2019-11-27 18:46:37,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:38,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78080786] [2019-11-27 18:46:38,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:38,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-27 18:46:38,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702787283] [2019-11-27 18:46:38,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:46:38,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:38,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:46:38,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:46:38,097 INFO L87 Difference]: Start difference. First operand 35467 states and 149246 transitions. Second operand 10 states. [2019-11-27 18:46:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:38,792 INFO L93 Difference]: Finished difference Result 49949 states and 204488 transitions. [2019-11-27 18:46:38,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 18:46:38,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-11-27 18:46:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:38,938 INFO L225 Difference]: With dead ends: 49949 [2019-11-27 18:46:38,938 INFO L226 Difference]: Without dead ends: 45133 [2019-11-27 18:46:38,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-11-27 18:46:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45133 states. [2019-11-27 18:46:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45133 to 35382. [2019-11-27 18:46:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35382 states. [2019-11-27 18:46:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35382 states to 35382 states and 148988 transitions. [2019-11-27 18:46:40,319 INFO L78 Accepts]: Start accepts. Automaton has 35382 states and 148988 transitions. Word has length 44 [2019-11-27 18:46:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:40,320 INFO L462 AbstractCegarLoop]: Abstraction has 35382 states and 148988 transitions. [2019-11-27 18:46:40,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:46:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 35382 states and 148988 transitions. [2019-11-27 18:46:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-27 18:46:40,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:40,332 INFO L410 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, 1, 1, 1, 1] [2019-11-27 18:46:40,332 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:40,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:40,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1040550282, now seen corresponding path program 1 times [2019-11-27 18:46:40,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:40,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226147725] [2019-11-27 18:46:40,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:40,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226147725] [2019-11-27 18:46:40,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:40,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 18:46:40,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644367036] [2019-11-27 18:46:40,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:46:40,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:40,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:46:40,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:46:40,394 INFO L87 Difference]: Start difference. First operand 35382 states and 148988 transitions. Second operand 5 states. [2019-11-27 18:46:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:40,700 INFO L93 Difference]: Finished difference Result 41393 states and 173198 transitions. [2019-11-27 18:46:40,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:46:40,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-27 18:46:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:40,796 INFO L225 Difference]: With dead ends: 41393 [2019-11-27 18:46:40,797 INFO L226 Difference]: Without dead ends: 40913 [2019-11-27 18:46:40,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:46:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40913 states. [2019-11-27 18:46:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40913 to 38965. [2019-11-27 18:46:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38965 states. [2019-11-27 18:46:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38965 states to 38965 states and 164378 transitions. [2019-11-27 18:46:41,534 INFO L78 Accepts]: Start accepts. Automaton has 38965 states and 164378 transitions. Word has length 45 [2019-11-27 18:46:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:41,534 INFO L462 AbstractCegarLoop]: Abstraction has 38965 states and 164378 transitions. [2019-11-27 18:46:41,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:46:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 38965 states and 164378 transitions. [2019-11-27 18:46:41,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-27 18:46:41,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:41,547 INFO L410 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, 1, 1, 1, 1] [2019-11-27 18:46:41,547 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1357053514, now seen corresponding path program 2 times [2019-11-27 18:46:41,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:41,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658771650] [2019-11-27 18:46:41,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:41,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658771650] [2019-11-27 18:46:41,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:41,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 18:46:41,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762579590] [2019-11-27 18:46:41,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:46:41,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:41,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:46:41,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:46:41,650 INFO L87 Difference]: Start difference. First operand 38965 states and 164378 transitions. Second operand 8 states. [2019-11-27 18:46:42,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:42,159 INFO L93 Difference]: Finished difference Result 41852 states and 174248 transitions. [2019-11-27 18:46:42,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:46:42,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-27 18:46:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:42,261 INFO L225 Difference]: With dead ends: 41852 [2019-11-27 18:46:42,261 INFO L226 Difference]: Without dead ends: 41372 [2019-11-27 18:46:42,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:46:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41372 states. [2019-11-27 18:46:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41372 to 36093. [2019-11-27 18:46:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36093 states. [2019-11-27 18:46:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36093 states to 36093 states and 150964 transitions. [2019-11-27 18:46:43,386 INFO L78 Accepts]: Start accepts. Automaton has 36093 states and 150964 transitions. Word has length 45 [2019-11-27 18:46:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:43,386 INFO L462 AbstractCegarLoop]: Abstraction has 36093 states and 150964 transitions. [2019-11-27 18:46:43,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:46:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 36093 states and 150964 transitions. [2019-11-27 18:46:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-27 18:46:43,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:43,397 INFO L410 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, 1, 1, 1, 1] [2019-11-27 18:46:43,397 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:43,398 INFO L82 PathProgramCache]: Analyzing trace with hash 335420672, now seen corresponding path program 3 times [2019-11-27 18:46:43,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:43,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478438030] [2019-11-27 18:46:43,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:43,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478438030] [2019-11-27 18:46:43,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:43,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-27 18:46:43,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002739144] [2019-11-27 18:46:43,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:46:43,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:43,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:46:43,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:46:43,568 INFO L87 Difference]: Start difference. First operand 36093 states and 150964 transitions. Second operand 10 states. [2019-11-27 18:46:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:44,508 INFO L93 Difference]: Finished difference Result 42962 states and 180318 transitions. [2019-11-27 18:46:44,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 18:46:44,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-27 18:46:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:44,610 INFO L225 Difference]: With dead ends: 42962 [2019-11-27 18:46:44,611 INFO L226 Difference]: Without dead ends: 42716 [2019-11-27 18:46:44,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-27 18:46:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42716 states. [2019-11-27 18:46:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42716 to 39089. [2019-11-27 18:46:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39089 states. [2019-11-27 18:46:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39089 states to 39089 states and 165489 transitions. [2019-11-27 18:46:45,386 INFO L78 Accepts]: Start accepts. Automaton has 39089 states and 165489 transitions. Word has length 45 [2019-11-27 18:46:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:45,387 INFO L462 AbstractCegarLoop]: Abstraction has 39089 states and 165489 transitions. [2019-11-27 18:46:45,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:46:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 39089 states and 165489 transitions. [2019-11-27 18:46:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-27 18:46:45,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:45,400 INFO L410 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, 1, 1, 1, 1] [2019-11-27 18:46:45,401 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:45,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:45,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1972664708, now seen corresponding path program 4 times [2019-11-27 18:46:45,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:45,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748113277] [2019-11-27 18:46:45,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:45,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748113277] [2019-11-27 18:46:45,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:45,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-27 18:46:45,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229655691] [2019-11-27 18:46:45,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 18:46:45,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:45,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 18:46:45,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:46:45,604 INFO L87 Difference]: Start difference. First operand 39089 states and 165489 transitions. Second operand 12 states. [2019-11-27 18:46:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:46,251 INFO L93 Difference]: Finished difference Result 53313 states and 227626 transitions. [2019-11-27 18:46:46,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 18:46:46,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-11-27 18:46:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:46,396 INFO L225 Difference]: With dead ends: 53313 [2019-11-27 18:46:46,396 INFO L226 Difference]: Without dead ends: 53067 [2019-11-27 18:46:46,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-11-27 18:46:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53067 states. [2019-11-27 18:46:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53067 to 39087. [2019-11-27 18:46:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39087 states. [2019-11-27 18:46:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39087 states to 39087 states and 165485 transitions. [2019-11-27 18:46:47,985 INFO L78 Accepts]: Start accepts. Automaton has 39087 states and 165485 transitions. Word has length 45 [2019-11-27 18:46:47,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:47,986 INFO L462 AbstractCegarLoop]: Abstraction has 39087 states and 165485 transitions. [2019-11-27 18:46:47,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 18:46:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 39087 states and 165485 transitions. [2019-11-27 18:46:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-27 18:46:47,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:48,000 INFO L410 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, 1, 1, 1, 1] [2019-11-27 18:46:48,000 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:48,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:48,000 INFO L82 PathProgramCache]: Analyzing trace with hash -237289220, now seen corresponding path program 5 times [2019-11-27 18:46:48,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:48,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525349536] [2019-11-27 18:46:48,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:48,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525349536] [2019-11-27 18:46:48,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:48,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-27 18:46:48,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572040016] [2019-11-27 18:46:48,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 18:46:48,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:48,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 18:46:48,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-27 18:46:48,416 INFO L87 Difference]: Start difference. First operand 39087 states and 165485 transitions. Second operand 15 states. [2019-11-27 18:46:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:49,833 INFO L93 Difference]: Finished difference Result 45916 states and 194740 transitions. [2019-11-27 18:46:49,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-27 18:46:49,833 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-11-27 18:46:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:49,942 INFO L225 Difference]: With dead ends: 45916 [2019-11-27 18:46:49,942 INFO L226 Difference]: Without dead ends: 45670 [2019-11-27 18:46:49,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-11-27 18:46:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45670 states. [2019-11-27 18:46:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45670 to 39029. [2019-11-27 18:46:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39029 states. [2019-11-27 18:46:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39029 states to 39029 states and 165325 transitions. [2019-11-27 18:46:50,712 INFO L78 Accepts]: Start accepts. Automaton has 39029 states and 165325 transitions. Word has length 45 [2019-11-27 18:46:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:50,714 INFO L462 AbstractCegarLoop]: Abstraction has 39029 states and 165325 transitions. [2019-11-27 18:46:50,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 18:46:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 39029 states and 165325 transitions. [2019-11-27 18:46:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 18:46:50,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:50,732 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-27 18:46:50,732 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:50,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:50,732 INFO L82 PathProgramCache]: Analyzing trace with hash -237203330, now seen corresponding path program 1 times [2019-11-27 18:46:50,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:50,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421918593] [2019-11-27 18:46:50,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:50,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421918593] [2019-11-27 18:46:50,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:50,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-27 18:46:50,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954344861] [2019-11-27 18:46:50,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:46:50,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:50,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:46:50,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:46:50,857 INFO L87 Difference]: Start difference. First operand 39029 states and 165325 transitions. Second operand 10 states. [2019-11-27 18:46:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:51,370 INFO L93 Difference]: Finished difference Result 51611 states and 218018 transitions. [2019-11-27 18:46:51,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 18:46:51,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-11-27 18:46:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:51,517 INFO L225 Difference]: With dead ends: 51611 [2019-11-27 18:46:51,518 INFO L226 Difference]: Without dead ends: 51305 [2019-11-27 18:46:51,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-11-27 18:46:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51305 states. [2019-11-27 18:46:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51305 to 39028. [2019-11-27 18:46:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39028 states. [2019-11-27 18:46:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39028 states to 39028 states and 165324 transitions. [2019-11-27 18:46:52,332 INFO L78 Accepts]: Start accepts. Automaton has 39028 states and 165324 transitions. Word has length 47 [2019-11-27 18:46:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:52,332 INFO L462 AbstractCegarLoop]: Abstraction has 39028 states and 165324 transitions. [2019-11-27 18:46:52,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:46:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 39028 states and 165324 transitions. [2019-11-27 18:46:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 18:46:52,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:52,350 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-27 18:46:52,351 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:52,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:52,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1279105862, now seen corresponding path program 2 times [2019-11-27 18:46:52,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:52,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65495843] [2019-11-27 18:46:52,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:52,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65495843] [2019-11-27 18:46:52,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:52,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-27 18:46:52,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197932193] [2019-11-27 18:46:52,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 18:46:52,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:52,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 18:46:52,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:46:52,810 INFO L87 Difference]: Start difference. First operand 39028 states and 165324 transitions. Second operand 14 states. [2019-11-27 18:46:53,951 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-11-27 18:46:54,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:54,668 INFO L93 Difference]: Finished difference Result 44937 states and 188326 transitions. [2019-11-27 18:46:54,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 18:46:54,668 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-11-27 18:46:54,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:54,772 INFO L225 Difference]: With dead ends: 44937 [2019-11-27 18:46:54,773 INFO L226 Difference]: Without dead ends: 44631 [2019-11-27 18:46:54,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:46:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44631 states. [2019-11-27 18:46:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44631 to 37958. [2019-11-27 18:46:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37958 states. [2019-11-27 18:46:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37958 states to 37958 states and 160183 transitions. [2019-11-27 18:46:55,538 INFO L78 Accepts]: Start accepts. Automaton has 37958 states and 160183 transitions. Word has length 47 [2019-11-27 18:46:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:55,538 INFO L462 AbstractCegarLoop]: Abstraction has 37958 states and 160183 transitions. [2019-11-27 18:46:55,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 18:46:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 37958 states and 160183 transitions. [2019-11-27 18:46:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 18:46:55,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:55,557 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-27 18:46:55,557 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:55,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:55,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1755610754, now seen corresponding path program 1 times [2019-11-27 18:46:55,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:55,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546730814] [2019-11-27 18:46:55,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:55,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546730814] [2019-11-27 18:46:55,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:55,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-27 18:46:55,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66575965] [2019-11-27 18:46:55,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 18:46:55,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:55,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 18:46:55,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:46:55,762 INFO L87 Difference]: Start difference. First operand 37958 states and 160183 transitions. Second operand 12 states. [2019-11-27 18:46:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:56,531 INFO L93 Difference]: Finished difference Result 54466 states and 223015 transitions. [2019-11-27 18:46:56,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 18:46:56,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-11-27 18:46:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:56,652 INFO L225 Difference]: With dead ends: 54466 [2019-11-27 18:46:56,652 INFO L226 Difference]: Without dead ends: 47822 [2019-11-27 18:46:56,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-11-27 18:46:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47822 states. [2019-11-27 18:46:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47822 to 37752. [2019-11-27 18:46:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37752 states. [2019-11-27 18:46:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37752 states to 37752 states and 159365 transitions. [2019-11-27 18:46:57,442 INFO L78 Accepts]: Start accepts. Automaton has 37752 states and 159365 transitions. Word has length 47 [2019-11-27 18:46:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:46:57,442 INFO L462 AbstractCegarLoop]: Abstraction has 37752 states and 159365 transitions. [2019-11-27 18:46:57,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 18:46:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 37752 states and 159365 transitions. [2019-11-27 18:46:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 18:46:57,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:46:57,457 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-27 18:46:57,457 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:46:57,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:46:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1197832933, now seen corresponding path program 1 times [2019-11-27 18:46:57,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:46:57,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324166700] [2019-11-27 18:46:57,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:46:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:46:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:46:57,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324166700] [2019-11-27 18:46:57,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:46:57,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-27 18:46:57,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530502114] [2019-11-27 18:46:57,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 18:46:57,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:46:57,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 18:46:57,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:46:57,830 INFO L87 Difference]: Start difference. First operand 37752 states and 159365 transitions. Second operand 14 states. [2019-11-27 18:46:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:46:59,371 INFO L93 Difference]: Finished difference Result 48404 states and 202537 transitions. [2019-11-27 18:46:59,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 18:46:59,374 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-11-27 18:46:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:46:59,488 INFO L225 Difference]: With dead ends: 48404 [2019-11-27 18:46:59,488 INFO L226 Difference]: Without dead ends: 48098 [2019-11-27 18:46:59,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2019-11-27 18:46:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48098 states. [2019-11-27 18:47:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48098 to 37743. [2019-11-27 18:47:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37743 states. [2019-11-27 18:47:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37743 states to 37743 states and 159350 transitions. [2019-11-27 18:47:00,301 INFO L78 Accepts]: Start accepts. Automaton has 37743 states and 159350 transitions. Word has length 47 [2019-11-27 18:47:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:00,301 INFO L462 AbstractCegarLoop]: Abstraction has 37743 states and 159350 transitions. [2019-11-27 18:47:00,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 18:47:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 37743 states and 159350 transitions. [2019-11-27 18:47:00,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 18:47:00,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:00,317 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:00,317 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:00,318 INFO L82 PathProgramCache]: Analyzing trace with hash -53538853, now seen corresponding path program 2 times [2019-11-27 18:47:00,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:00,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036626445] [2019-11-27 18:47:00,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:00,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036626445] [2019-11-27 18:47:00,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:00,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-27 18:47:00,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599593827] [2019-11-27 18:47:00,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 18:47:00,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:00,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 18:47:00,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:47:00,674 INFO L87 Difference]: Start difference. First operand 37743 states and 159350 transitions. Second operand 14 states. [2019-11-27 18:47:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:01,923 INFO L93 Difference]: Finished difference Result 43702 states and 182857 transitions. [2019-11-27 18:47:01,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 18:47:01,924 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-11-27 18:47:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:02,532 INFO L225 Difference]: With dead ends: 43702 [2019-11-27 18:47:02,532 INFO L226 Difference]: Without dead ends: 43396 [2019-11-27 18:47:02,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-11-27 18:47:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43396 states. [2019-11-27 18:47:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43396 to 35601. [2019-11-27 18:47:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35601 states. [2019-11-27 18:47:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35601 states to 35601 states and 149339 transitions. [2019-11-27 18:47:03,261 INFO L78 Accepts]: Start accepts. Automaton has 35601 states and 149339 transitions. Word has length 47 [2019-11-27 18:47:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:03,261 INFO L462 AbstractCegarLoop]: Abstraction has 35601 states and 149339 transitions. [2019-11-27 18:47:03,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 18:47:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 35601 states and 149339 transitions. [2019-11-27 18:47:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 18:47:03,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:03,276 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:03,276 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:03,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2013384893, now seen corresponding path program 1 times [2019-11-27 18:47:03,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:03,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691051991] [2019-11-27 18:47:03,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:03,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691051991] [2019-11-27 18:47:03,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:03,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-27 18:47:03,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569375724] [2019-11-27 18:47:03,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 18:47:03,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:03,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 18:47:03,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-27 18:47:03,740 INFO L87 Difference]: Start difference. First operand 35601 states and 149339 transitions. Second operand 16 states. [2019-11-27 18:47:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:05,629 INFO L93 Difference]: Finished difference Result 45102 states and 190564 transitions. [2019-11-27 18:47:05,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 18:47:05,629 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2019-11-27 18:47:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:05,736 INFO L225 Difference]: With dead ends: 45102 [2019-11-27 18:47:05,736 INFO L226 Difference]: Without dead ends: 44856 [2019-11-27 18:47:05,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-11-27 18:47:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44856 states. [2019-11-27 18:47:06,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44856 to 37548. [2019-11-27 18:47:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37548 states. [2019-11-27 18:47:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37548 states to 37548 states and 159873 transitions. [2019-11-27 18:47:06,518 INFO L78 Accepts]: Start accepts. Automaton has 37548 states and 159873 transitions. Word has length 47 [2019-11-27 18:47:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:06,518 INFO L462 AbstractCegarLoop]: Abstraction has 37548 states and 159873 transitions. [2019-11-27 18:47:06,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 18:47:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 37548 states and 159873 transitions. [2019-11-27 18:47:06,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-27 18:47:06,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:06,540 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:06,540 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:06,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:06,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1496907519, now seen corresponding path program 1 times [2019-11-27 18:47:06,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:06,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511894720] [2019-11-27 18:47:06,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:07,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511894720] [2019-11-27 18:47:07,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:07,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-27 18:47:07,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969782717] [2019-11-27 18:47:07,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 18:47:07,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 18:47:07,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-27 18:47:07,045 INFO L87 Difference]: Start difference. First operand 37548 states and 159873 transitions. Second operand 16 states. [2019-11-27 18:47:07,897 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-11-27 18:47:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:08,811 INFO L93 Difference]: Finished difference Result 42944 states and 180663 transitions. [2019-11-27 18:47:08,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 18:47:08,812 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2019-11-27 18:47:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:08,914 INFO L225 Difference]: With dead ends: 42944 [2019-11-27 18:47:08,914 INFO L226 Difference]: Without dead ends: 42638 [2019-11-27 18:47:08,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-11-27 18:47:09,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42638 states. [2019-11-27 18:47:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42638 to 34161. [2019-11-27 18:47:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34161 states. [2019-11-27 18:47:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34161 states to 34161 states and 144013 transitions. [2019-11-27 18:47:09,642 INFO L78 Accepts]: Start accepts. Automaton has 34161 states and 144013 transitions. Word has length 49 [2019-11-27 18:47:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:09,643 INFO L462 AbstractCegarLoop]: Abstraction has 34161 states and 144013 transitions. [2019-11-27 18:47:09,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 18:47:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 34161 states and 144013 transitions. [2019-11-27 18:47:09,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 18:47:09,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:09,672 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:09,673 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:09,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:09,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1847573331, now seen corresponding path program 1 times [2019-11-27 18:47:09,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:09,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029086768] [2019-11-27 18:47:09,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:09,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029086768] [2019-11-27 18:47:09,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:09,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 18:47:09,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535948197] [2019-11-27 18:47:09,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:47:09,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:09,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:47:09,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:47:09,723 INFO L87 Difference]: Start difference. First operand 34161 states and 144013 transitions. Second operand 5 states. [2019-11-27 18:47:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:09,996 INFO L93 Difference]: Finished difference Result 38902 states and 161891 transitions. [2019-11-27 18:47:09,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:47:09,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-27 18:47:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:10,086 INFO L225 Difference]: With dead ends: 38902 [2019-11-27 18:47:10,086 INFO L226 Difference]: Without dead ends: 38068 [2019-11-27 18:47:10,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:47:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38068 states. [2019-11-27 18:47:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38068 to 36250. [2019-11-27 18:47:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36250 states. [2019-11-27 18:47:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36250 states to 36250 states and 152433 transitions. [2019-11-27 18:47:11,204 INFO L78 Accepts]: Start accepts. Automaton has 36250 states and 152433 transitions. Word has length 50 [2019-11-27 18:47:11,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:11,204 INFO L462 AbstractCegarLoop]: Abstraction has 36250 states and 152433 transitions. [2019-11-27 18:47:11,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:47:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 36250 states and 152433 transitions. [2019-11-27 18:47:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 18:47:11,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:11,233 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:11,234 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 85080083, now seen corresponding path program 2 times [2019-11-27 18:47:11,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:11,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755324888] [2019-11-27 18:47:11,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:11,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755324888] [2019-11-27 18:47:11,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:11,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 18:47:11,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54606841] [2019-11-27 18:47:11,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:47:11,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:11,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:47:11,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:47:11,322 INFO L87 Difference]: Start difference. First operand 36250 states and 152433 transitions. Second operand 8 states. [2019-11-27 18:47:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:11,773 INFO L93 Difference]: Finished difference Result 40970 states and 170279 transitions. [2019-11-27 18:47:11,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:47:11,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-27 18:47:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:11,867 INFO L225 Difference]: With dead ends: 40970 [2019-11-27 18:47:11,868 INFO L226 Difference]: Without dead ends: 40136 [2019-11-27 18:47:11,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:47:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40136 states. [2019-11-27 18:47:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40136 to 36229. [2019-11-27 18:47:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36229 states. [2019-11-27 18:47:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36229 states to 36229 states and 152401 transitions. [2019-11-27 18:47:12,591 INFO L78 Accepts]: Start accepts. Automaton has 36229 states and 152401 transitions. Word has length 50 [2019-11-27 18:47:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:12,591 INFO L462 AbstractCegarLoop]: Abstraction has 36229 states and 152401 transitions. [2019-11-27 18:47:12,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:47:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 36229 states and 152401 transitions. [2019-11-27 18:47:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 18:47:12,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:12,615 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:12,615 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:12,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:12,615 INFO L82 PathProgramCache]: Analyzing trace with hash 368089865, now seen corresponding path program 3 times [2019-11-27 18:47:12,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:12,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106354089] [2019-11-27 18:47:12,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:12,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106354089] [2019-11-27 18:47:12,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:12,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-27 18:47:12,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759786404] [2019-11-27 18:47:12,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:47:12,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:12,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:47:12,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:47:12,757 INFO L87 Difference]: Start difference. First operand 36229 states and 152401 transitions. Second operand 10 states. [2019-11-27 18:47:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:13,483 INFO L93 Difference]: Finished difference Result 40944 states and 170238 transitions. [2019-11-27 18:47:13,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 18:47:13,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-11-27 18:47:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:13,578 INFO L225 Difference]: With dead ends: 40944 [2019-11-27 18:47:13,578 INFO L226 Difference]: Without dead ends: 40110 [2019-11-27 18:47:13,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-27 18:47:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40110 states. [2019-11-27 18:47:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40110 to 36224. [2019-11-27 18:47:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36224 states. [2019-11-27 18:47:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36224 states to 36224 states and 152392 transitions. [2019-11-27 18:47:14,300 INFO L78 Accepts]: Start accepts. Automaton has 36224 states and 152392 transitions. Word has length 50 [2019-11-27 18:47:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:14,301 INFO L462 AbstractCegarLoop]: Abstraction has 36224 states and 152392 transitions. [2019-11-27 18:47:14,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:47:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 36224 states and 152392 transitions. [2019-11-27 18:47:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 18:47:14,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:14,324 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:14,324 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:14,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:14,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1194704651, now seen corresponding path program 1 times [2019-11-27 18:47:14,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:14,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829427278] [2019-11-27 18:47:14,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:14,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829427278] [2019-11-27 18:47:14,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:14,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-27 18:47:14,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136596542] [2019-11-27 18:47:14,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 18:47:14,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:14,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 18:47:14,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:47:14,509 INFO L87 Difference]: Start difference. First operand 36224 states and 152392 transitions. Second operand 14 states. [2019-11-27 18:47:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:15,409 INFO L93 Difference]: Finished difference Result 55813 states and 227527 transitions. [2019-11-27 18:47:15,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 18:47:15,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-11-27 18:47:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:15,513 INFO L225 Difference]: With dead ends: 55813 [2019-11-27 18:47:15,513 INFO L226 Difference]: Without dead ends: 41645 [2019-11-27 18:47:15,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2019-11-27 18:47:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41645 states. [2019-11-27 18:47:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41645 to 31645. [2019-11-27 18:47:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31645 states. [2019-11-27 18:47:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31645 states to 31645 states and 132063 transitions. [2019-11-27 18:47:16,201 INFO L78 Accepts]: Start accepts. Automaton has 31645 states and 132063 transitions. Word has length 50 [2019-11-27 18:47:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:16,202 INFO L462 AbstractCegarLoop]: Abstraction has 31645 states and 132063 transitions. [2019-11-27 18:47:16,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 18:47:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 31645 states and 132063 transitions. [2019-11-27 18:47:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 18:47:16,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:16,222 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:16,223 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash 557019397, now seen corresponding path program 4 times [2019-11-27 18:47:16,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:16,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996955423] [2019-11-27 18:47:16,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:16,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996955423] [2019-11-27 18:47:16,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:16,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-27 18:47:16,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035995404] [2019-11-27 18:47:16,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 18:47:16,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:16,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 18:47:16,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:47:16,428 INFO L87 Difference]: Start difference. First operand 31645 states and 132063 transitions. Second operand 12 states. [2019-11-27 18:47:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:17,129 INFO L93 Difference]: Finished difference Result 35903 states and 148202 transitions. [2019-11-27 18:47:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 18:47:17,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-11-27 18:47:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:17,210 INFO L225 Difference]: With dead ends: 35903 [2019-11-27 18:47:17,211 INFO L226 Difference]: Without dead ends: 35264 [2019-11-27 18:47:17,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:47:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35264 states. [2019-11-27 18:47:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35264 to 31635. [2019-11-27 18:47:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2019-11-27 18:47:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 132039 transitions. [2019-11-27 18:47:18,276 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 132039 transitions. Word has length 50 [2019-11-27 18:47:18,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:18,277 INFO L462 AbstractCegarLoop]: Abstraction has 31635 states and 132039 transitions. [2019-11-27 18:47:18,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 18:47:18,277 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 132039 transitions. [2019-11-27 18:47:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 18:47:18,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:18,296 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:18,297 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:18,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:18,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1504475862, now seen corresponding path program 1 times [2019-11-27 18:47:18,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:18,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144494407] [2019-11-27 18:47:18,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:19,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144494407] [2019-11-27 18:47:19,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:19,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-27 18:47:19,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059453925] [2019-11-27 18:47:19,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 18:47:19,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:19,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 18:47:19,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-27 18:47:19,080 INFO L87 Difference]: Start difference. First operand 31635 states and 132039 transitions. Second operand 18 states. [2019-11-27 18:47:20,247 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-11-27 18:47:20,751 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-11-27 18:47:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:21,724 INFO L93 Difference]: Finished difference Result 34237 states and 140880 transitions. [2019-11-27 18:47:21,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-27 18:47:21,724 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-11-27 18:47:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:21,802 INFO L225 Difference]: With dead ends: 34237 [2019-11-27 18:47:21,802 INFO L226 Difference]: Without dead ends: 33415 [2019-11-27 18:47:21,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2019-11-27 18:47:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33415 states. [2019-11-27 18:47:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33415 to 26641. [2019-11-27 18:47:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26641 states. [2019-11-27 18:47:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26641 states to 26641 states and 110388 transitions. [2019-11-27 18:47:22,359 INFO L78 Accepts]: Start accepts. Automaton has 26641 states and 110388 transitions. Word has length 50 [2019-11-27 18:47:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:22,360 INFO L462 AbstractCegarLoop]: Abstraction has 26641 states and 110388 transitions. [2019-11-27 18:47:22,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 18:47:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 26641 states and 110388 transitions. [2019-11-27 18:47:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 18:47:22,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:22,378 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:22,378 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash 238485273, now seen corresponding path program 5 times [2019-11-27 18:47:22,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:22,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240170464] [2019-11-27 18:47:22,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:22,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240170464] [2019-11-27 18:47:22,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:22,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-27 18:47:22,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977617134] [2019-11-27 18:47:22,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 18:47:22,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:22,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 18:47:22,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-27 18:47:22,860 INFO L87 Difference]: Start difference. First operand 26641 states and 110388 transitions. Second operand 16 states. [2019-11-27 18:47:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:23,926 INFO L93 Difference]: Finished difference Result 30874 states and 126473 transitions. [2019-11-27 18:47:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 18:47:23,927 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-11-27 18:47:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:23,998 INFO L225 Difference]: With dead ends: 30874 [2019-11-27 18:47:23,998 INFO L226 Difference]: Without dead ends: 30235 [2019-11-27 18:47:23,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:47:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30235 states. [2019-11-27 18:47:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30235 to 26641. [2019-11-27 18:47:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26641 states. [2019-11-27 18:47:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26641 states to 26641 states and 110298 transitions. [2019-11-27 18:47:24,519 INFO L78 Accepts]: Start accepts. Automaton has 26641 states and 110298 transitions. Word has length 50 [2019-11-27 18:47:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:24,519 INFO L462 AbstractCegarLoop]: Abstraction has 26641 states and 110298 transitions. [2019-11-27 18:47:24,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 18:47:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 26641 states and 110298 transitions. [2019-11-27 18:47:24,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 18:47:24,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:24,535 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:24,535 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:24,536 INFO L82 PathProgramCache]: Analyzing trace with hash -467336723, now seen corresponding path program 6 times [2019-11-27 18:47:24,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:24,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502279058] [2019-11-27 18:47:24,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:24,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502279058] [2019-11-27 18:47:24,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:24,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-27 18:47:24,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932335222] [2019-11-27 18:47:24,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 18:47:24,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 18:47:24,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:47:24,737 INFO L87 Difference]: Start difference. First operand 26641 states and 110298 transitions. Second operand 14 states. [2019-11-27 18:47:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:25,609 INFO L93 Difference]: Finished difference Result 35760 states and 145343 transitions. [2019-11-27 18:47:25,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:47:25,610 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-11-27 18:47:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:25,691 INFO L225 Difference]: With dead ends: 35760 [2019-11-27 18:47:25,691 INFO L226 Difference]: Without dead ends: 35121 [2019-11-27 18:47:25,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-11-27 18:47:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35121 states. [2019-11-27 18:47:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35121 to 26069. [2019-11-27 18:47:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26069 states. [2019-11-27 18:47:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26069 states to 26069 states and 107734 transitions. [2019-11-27 18:47:26,235 INFO L78 Accepts]: Start accepts. Automaton has 26069 states and 107734 transitions. Word has length 50 [2019-11-27 18:47:26,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:26,235 INFO L462 AbstractCegarLoop]: Abstraction has 26069 states and 107734 transitions. [2019-11-27 18:47:26,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 18:47:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 26069 states and 107734 transitions. [2019-11-27 18:47:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-27 18:47:26,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:26,256 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:26,256 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:26,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:26,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1790589462, now seen corresponding path program 1 times [2019-11-27 18:47:26,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:26,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525956357] [2019-11-27 18:47:26,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:26,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525956357] [2019-11-27 18:47:26,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:26,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-27 18:47:26,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963672738] [2019-11-27 18:47:26,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 18:47:26,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 18:47:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-11-27 18:47:26,849 INFO L87 Difference]: Start difference. First operand 26069 states and 107734 transitions. Second operand 18 states. [2019-11-27 18:47:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:29,379 INFO L93 Difference]: Finished difference Result 26868 states and 109219 transitions. [2019-11-27 18:47:29,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-27 18:47:29,379 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-27 18:47:29,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:29,436 INFO L225 Difference]: With dead ends: 26868 [2019-11-27 18:47:29,436 INFO L226 Difference]: Without dead ends: 25824 [2019-11-27 18:47:29,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2019-11-27 18:47:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25824 states. [2019-11-27 18:47:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25824 to 20400. [2019-11-27 18:47:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20400 states. [2019-11-27 18:47:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20400 states to 20400 states and 83216 transitions. [2019-11-27 18:47:30,085 INFO L78 Accepts]: Start accepts. Automaton has 20400 states and 83216 transitions. Word has length 52 [2019-11-27 18:47:30,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:30,085 INFO L462 AbstractCegarLoop]: Abstraction has 20400 states and 83216 transitions. [2019-11-27 18:47:30,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 18:47:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 20400 states and 83216 transitions. [2019-11-27 18:47:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-27 18:47:30,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:30,103 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:30,103 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:30,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash 610346052, now seen corresponding path program 1 times [2019-11-27 18:47:30,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:30,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622663481] [2019-11-27 18:47:30,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:30,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622663481] [2019-11-27 18:47:30,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:30,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-27 18:47:30,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424059984] [2019-11-27 18:47:30,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 18:47:30,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:30,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 18:47:30,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:47:30,505 INFO L87 Difference]: Start difference. First operand 20400 states and 83216 transitions. Second operand 14 states. [2019-11-27 18:47:31,769 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-11-27 18:47:32,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:32,247 INFO L93 Difference]: Finished difference Result 25840 states and 104248 transitions. [2019-11-27 18:47:32,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:47:32,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-11-27 18:47:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:32,305 INFO L225 Difference]: With dead ends: 25840 [2019-11-27 18:47:32,306 INFO L226 Difference]: Without dead ends: 25471 [2019-11-27 18:47:32,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-11-27 18:47:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25471 states. [2019-11-27 18:47:32,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25471 to 20430. [2019-11-27 18:47:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20430 states. [2019-11-27 18:47:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20430 states to 20430 states and 83308 transitions. [2019-11-27 18:47:32,718 INFO L78 Accepts]: Start accepts. Automaton has 20430 states and 83308 transitions. Word has length 52 [2019-11-27 18:47:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:32,718 INFO L462 AbstractCegarLoop]: Abstraction has 20430 states and 83308 transitions. [2019-11-27 18:47:32,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 18:47:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 20430 states and 83308 transitions. [2019-11-27 18:47:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-27 18:47:32,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:32,736 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:32,736 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:32,736 INFO L82 PathProgramCache]: Analyzing trace with hash -414010068, now seen corresponding path program 2 times [2019-11-27 18:47:32,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:32,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698839677] [2019-11-27 18:47:32,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:33,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698839677] [2019-11-27 18:47:33,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:33,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-27 18:47:33,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910452326] [2019-11-27 18:47:33,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 18:47:33,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:33,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 18:47:33,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-27 18:47:33,079 INFO L87 Difference]: Start difference. First operand 20430 states and 83308 transitions. Second operand 16 states. [2019-11-27 18:47:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:34,470 INFO L93 Difference]: Finished difference Result 27069 states and 108818 transitions. [2019-11-27 18:47:34,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:47:34,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2019-11-27 18:47:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:34,531 INFO L225 Difference]: With dead ends: 27069 [2019-11-27 18:47:34,531 INFO L226 Difference]: Without dead ends: 26700 [2019-11-27 18:47:34,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-11-27 18:47:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26700 states. [2019-11-27 18:47:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26700 to 20091. [2019-11-27 18:47:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20091 states. [2019-11-27 18:47:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20091 states to 20091 states and 82206 transitions. [2019-11-27 18:47:34,952 INFO L78 Accepts]: Start accepts. Automaton has 20091 states and 82206 transitions. Word has length 52 [2019-11-27 18:47:34,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:34,952 INFO L462 AbstractCegarLoop]: Abstraction has 20091 states and 82206 transitions. [2019-11-27 18:47:34,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 18:47:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 20091 states and 82206 transitions. [2019-11-27 18:47:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-27 18:47:34,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:34,971 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:34,971 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:34,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:34,971 INFO L82 PathProgramCache]: Analyzing trace with hash -650142920, now seen corresponding path program 1 times [2019-11-27 18:47:34,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:34,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669625590] [2019-11-27 18:47:34,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:35,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669625590] [2019-11-27 18:47:35,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:35,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-27 18:47:35,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015637322] [2019-11-27 18:47:35,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 18:47:35,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:35,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 18:47:35,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-27 18:47:35,577 INFO L87 Difference]: Start difference. First operand 20091 states and 82206 transitions. Second operand 18 states. [2019-11-27 18:47:36,206 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-11-27 18:47:36,537 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-11-27 18:47:36,694 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-11-27 18:47:36,817 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-11-27 18:47:36,947 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-11-27 18:47:37,113 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-11-27 18:47:37,860 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-11-27 18:47:38,081 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-11-27 18:47:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:38,647 INFO L93 Difference]: Finished difference Result 20593 states and 82993 transitions. [2019-11-27 18:47:38,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-27 18:47:38,648 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-27 18:47:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:38,690 INFO L225 Difference]: With dead ends: 20593 [2019-11-27 18:47:38,690 INFO L226 Difference]: Without dead ends: 18658 [2019-11-27 18:47:38,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=383, Invalid=1257, Unknown=0, NotChecked=0, Total=1640 [2019-11-27 18:47:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18658 states. [2019-11-27 18:47:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18658 to 12962. [2019-11-27 18:47:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12962 states. [2019-11-27 18:47:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 52687 transitions. [2019-11-27 18:47:38,968 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 52687 transitions. Word has length 52 [2019-11-27 18:47:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:38,968 INFO L462 AbstractCegarLoop]: Abstraction has 12962 states and 52687 transitions. [2019-11-27 18:47:38,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 18:47:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 52687 transitions. [2019-11-27 18:47:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:47:38,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:38,981 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:38,981 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1885292943, now seen corresponding path program 1 times [2019-11-27 18:47:38,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:38,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985285010] [2019-11-27 18:47:38,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:39,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985285010] [2019-11-27 18:47:39,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:39,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 18:47:39,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021762727] [2019-11-27 18:47:39,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:47:39,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:47:39,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:47:39,038 INFO L87 Difference]: Start difference. First operand 12962 states and 52687 transitions. Second operand 5 states. [2019-11-27 18:47:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:39,219 INFO L93 Difference]: Finished difference Result 15975 states and 63018 transitions. [2019-11-27 18:47:39,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:47:39,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-27 18:47:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:39,252 INFO L225 Difference]: With dead ends: 15975 [2019-11-27 18:47:39,252 INFO L226 Difference]: Without dead ends: 15255 [2019-11-27 18:47:39,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:47:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15255 states. [2019-11-27 18:47:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15255 to 14835. [2019-11-27 18:47:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14835 states. [2019-11-27 18:47:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14835 states to 14835 states and 59421 transitions. [2019-11-27 18:47:39,512 INFO L78 Accepts]: Start accepts. Automaton has 14835 states and 59421 transitions. Word has length 53 [2019-11-27 18:47:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:39,512 INFO L462 AbstractCegarLoop]: Abstraction has 14835 states and 59421 transitions. [2019-11-27 18:47:39,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:47:39,512 INFO L276 IsEmpty]: Start isEmpty. Operand 14835 states and 59421 transitions. [2019-11-27 18:47:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:47:39,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:39,526 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:39,527 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:39,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1948516785, now seen corresponding path program 2 times [2019-11-27 18:47:39,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:39,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647180328] [2019-11-27 18:47:39,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:39,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647180328] [2019-11-27 18:47:39,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:39,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 18:47:39,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746815120] [2019-11-27 18:47:39,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:47:39,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:39,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:47:39,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:47:39,633 INFO L87 Difference]: Start difference. First operand 14835 states and 59421 transitions. Second operand 8 states. [2019-11-27 18:47:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:40,154 INFO L93 Difference]: Finished difference Result 17827 states and 69720 transitions. [2019-11-27 18:47:40,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:47:40,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-27 18:47:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:40,202 INFO L225 Difference]: With dead ends: 17827 [2019-11-27 18:47:40,202 INFO L226 Difference]: Without dead ends: 17107 [2019-11-27 18:47:40,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:47:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17107 states. [2019-11-27 18:47:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17107 to 14814. [2019-11-27 18:47:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14814 states. [2019-11-27 18:47:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14814 states to 14814 states and 59389 transitions. [2019-11-27 18:47:40,494 INFO L78 Accepts]: Start accepts. Automaton has 14814 states and 59389 transitions. Word has length 53 [2019-11-27 18:47:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:40,495 INFO L462 AbstractCegarLoop]: Abstraction has 14814 states and 59389 transitions. [2019-11-27 18:47:40,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:47:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 14814 states and 59389 transitions. [2019-11-27 18:47:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:47:40,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:40,509 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:40,510 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2072130299, now seen corresponding path program 3 times [2019-11-27 18:47:40,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:40,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962227292] [2019-11-27 18:47:40,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:40,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962227292] [2019-11-27 18:47:40,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:40,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-27 18:47:40,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827877594] [2019-11-27 18:47:40,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:47:40,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:40,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:47:40,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:47:40,667 INFO L87 Difference]: Start difference. First operand 14814 states and 59389 transitions. Second operand 10 states. [2019-11-27 18:47:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:41,390 INFO L93 Difference]: Finished difference Result 17801 states and 69679 transitions. [2019-11-27 18:47:41,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 18:47:41,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-11-27 18:47:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:41,428 INFO L225 Difference]: With dead ends: 17801 [2019-11-27 18:47:41,428 INFO L226 Difference]: Without dead ends: 17081 [2019-11-27 18:47:41,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-27 18:47:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17081 states. [2019-11-27 18:47:41,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17081 to 14809. [2019-11-27 18:47:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14809 states. [2019-11-27 18:47:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 59380 transitions. [2019-11-27 18:47:41,847 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 59380 transitions. Word has length 53 [2019-11-27 18:47:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:41,847 INFO L462 AbstractCegarLoop]: Abstraction has 14809 states and 59380 transitions. [2019-11-27 18:47:41,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:47:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 59380 transitions. [2019-11-27 18:47:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:47:41,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:41,862 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:41,862 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:41,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:41,862 INFO L82 PathProgramCache]: Analyzing trace with hash -230306945, now seen corresponding path program 4 times [2019-11-27 18:47:41,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:41,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997203409] [2019-11-27 18:47:41,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:42,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997203409] [2019-11-27 18:47:42,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:42,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-27 18:47:42,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629193802] [2019-11-27 18:47:42,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 18:47:42,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:42,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 18:47:42,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 18:47:42,053 INFO L87 Difference]: Start difference. First operand 14809 states and 59380 transitions. Second operand 12 states. [2019-11-27 18:47:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:42,751 INFO L93 Difference]: Finished difference Result 17780 states and 69636 transitions. [2019-11-27 18:47:42,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 18:47:42,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-27 18:47:42,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:42,790 INFO L225 Difference]: With dead ends: 17780 [2019-11-27 18:47:42,790 INFO L226 Difference]: Without dead ends: 17060 [2019-11-27 18:47:42,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-11-27 18:47:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17060 states. [2019-11-27 18:47:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17060 to 14799. [2019-11-27 18:47:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14799 states. [2019-11-27 18:47:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14799 states to 14799 states and 59356 transitions. [2019-11-27 18:47:43,059 INFO L78 Accepts]: Start accepts. Automaton has 14799 states and 59356 transitions. Word has length 53 [2019-11-27 18:47:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:43,059 INFO L462 AbstractCegarLoop]: Abstraction has 14799 states and 59356 transitions. [2019-11-27 18:47:43,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 18:47:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 14799 states and 59356 transitions. [2019-11-27 18:47:43,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:47:43,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:43,073 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:43,073 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:43,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:43,073 INFO L82 PathProgramCache]: Analyzing trace with hash -149039827, now seen corresponding path program 5 times [2019-11-27 18:47:43,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:43,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742182550] [2019-11-27 18:47:43,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:43,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742182550] [2019-11-27 18:47:43,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:43,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-27 18:47:43,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534770233] [2019-11-27 18:47:43,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 18:47:43,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:43,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 18:47:43,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:47:43,436 INFO L87 Difference]: Start difference. First operand 14799 states and 59356 transitions. Second operand 14 states. [2019-11-27 18:47:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:44,359 INFO L93 Difference]: Finished difference Result 17735 states and 69515 transitions. [2019-11-27 18:47:44,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:47:44,360 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-11-27 18:47:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:44,396 INFO L225 Difference]: With dead ends: 17735 [2019-11-27 18:47:44,396 INFO L226 Difference]: Without dead ends: 17015 [2019-11-27 18:47:44,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2019-11-27 18:47:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17015 states. [2019-11-27 18:47:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17015 to 14779. [2019-11-27 18:47:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14779 states. [2019-11-27 18:47:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14779 states to 14779 states and 59290 transitions. [2019-11-27 18:47:44,666 INFO L78 Accepts]: Start accepts. Automaton has 14779 states and 59290 transitions. Word has length 53 [2019-11-27 18:47:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:44,666 INFO L462 AbstractCegarLoop]: Abstraction has 14779 states and 59290 transitions. [2019-11-27 18:47:44,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 18:47:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 14779 states and 59290 transitions. [2019-11-27 18:47:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:47:44,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:44,680 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:44,680 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:44,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1879007737, now seen corresponding path program 6 times [2019-11-27 18:47:44,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:44,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200496100] [2019-11-27 18:47:44,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:45,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200496100] [2019-11-27 18:47:45,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:45,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-27 18:47:45,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2461465] [2019-11-27 18:47:45,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 18:47:45,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:45,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 18:47:45,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-27 18:47:45,121 INFO L87 Difference]: Start difference. First operand 14779 states and 59290 transitions. Second operand 16 states. [2019-11-27 18:47:45,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:45,873 INFO L93 Difference]: Finished difference Result 17575 states and 69027 transitions. [2019-11-27 18:47:45,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 18:47:45,874 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-11-27 18:47:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:45,910 INFO L225 Difference]: With dead ends: 17575 [2019-11-27 18:47:45,911 INFO L226 Difference]: Without dead ends: 16855 [2019-11-27 18:47:45,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-11-27 18:47:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16855 states. [2019-11-27 18:47:46,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16855 to 14779. [2019-11-27 18:47:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14779 states. [2019-11-27 18:47:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14779 states to 14779 states and 59290 transitions. [2019-11-27 18:47:46,189 INFO L78 Accepts]: Start accepts. Automaton has 14779 states and 59290 transitions. Word has length 53 [2019-11-27 18:47:46,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:46,190 INFO L462 AbstractCegarLoop]: Abstraction has 14779 states and 59290 transitions. [2019-11-27 18:47:46,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 18:47:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 14779 states and 59290 transitions. [2019-11-27 18:47:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:47:46,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:46,205 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:46,205 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:46,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:46,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1567369699, now seen corresponding path program 7 times [2019-11-27 18:47:46,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:46,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235143556] [2019-11-27 18:47:46,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:46,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235143556] [2019-11-27 18:47:46,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:46,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-27 18:47:46,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372594999] [2019-11-27 18:47:46,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-27 18:47:46,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:46,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-27 18:47:46,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-27 18:47:46,789 INFO L87 Difference]: Start difference. First operand 14779 states and 59290 transitions. Second operand 19 states. [2019-11-27 18:47:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:49,130 INFO L93 Difference]: Finished difference Result 20719 states and 81367 transitions. [2019-11-27 18:47:49,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-27 18:47:49,131 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2019-11-27 18:47:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:49,169 INFO L225 Difference]: With dead ends: 20719 [2019-11-27 18:47:49,170 INFO L226 Difference]: Without dead ends: 18559 [2019-11-27 18:47:49,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=355, Invalid=1205, Unknown=0, NotChecked=0, Total=1560 [2019-11-27 18:47:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18559 states. [2019-11-27 18:47:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18559 to 14107. [2019-11-27 18:47:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14107 states. [2019-11-27 18:47:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14107 states to 14107 states and 56562 transitions. [2019-11-27 18:47:49,437 INFO L78 Accepts]: Start accepts. Automaton has 14107 states and 56562 transitions. Word has length 53 [2019-11-27 18:47:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:49,437 INFO L462 AbstractCegarLoop]: Abstraction has 14107 states and 56562 transitions. [2019-11-27 18:47:49,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-27 18:47:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 14107 states and 56562 transitions. [2019-11-27 18:47:49,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 18:47:49,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:49,452 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:49,452 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:49,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:49,452 INFO L82 PathProgramCache]: Analyzing trace with hash 692038795, now seen corresponding path program 8 times [2019-11-27 18:47:49,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:49,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942412459] [2019-11-27 18:47:49,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:49,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942412459] [2019-11-27 18:47:49,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:49,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-27 18:47:49,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574388095] [2019-11-27 18:47:49,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 18:47:49,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:49,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 18:47:49,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-27 18:47:49,880 INFO L87 Difference]: Start difference. First operand 14107 states and 56562 transitions. Second operand 16 states. [2019-11-27 18:47:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:50,734 INFO L93 Difference]: Finished difference Result 19933 states and 76843 transitions. [2019-11-27 18:47:50,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 18:47:50,734 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-11-27 18:47:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:50,772 INFO L225 Difference]: With dead ends: 19933 [2019-11-27 18:47:50,773 INFO L226 Difference]: Without dead ends: 19213 [2019-11-27 18:47:50,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=598, Unknown=0, NotChecked=0, Total=812 [2019-11-27 18:47:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19213 states. [2019-11-27 18:47:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19213 to 13403. [2019-11-27 18:47:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13403 states. [2019-11-27 18:47:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13403 states to 13403 states and 53710 transitions. [2019-11-27 18:47:51,033 INFO L78 Accepts]: Start accepts. Automaton has 13403 states and 53710 transitions. Word has length 53 [2019-11-27 18:47:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:51,033 INFO L462 AbstractCegarLoop]: Abstraction has 13403 states and 53710 transitions. [2019-11-27 18:47:51,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 18:47:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 13403 states and 53710 transitions. [2019-11-27 18:47:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-27 18:47:51,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:51,047 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:51,047 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:51,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:51,047 INFO L82 PathProgramCache]: Analyzing trace with hash -713827360, now seen corresponding path program 1 times [2019-11-27 18:47:51,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:51,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163224561] [2019-11-27 18:47:51,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:51,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163224561] [2019-11-27 18:47:51,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:51,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-27 18:47:51,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952286182] [2019-11-27 18:47:51,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 18:47:51,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:51,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 18:47:51,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:47:51,377 INFO L87 Difference]: Start difference. First operand 13403 states and 53710 transitions. Second operand 14 states. [2019-11-27 18:47:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:53,003 INFO L93 Difference]: Finished difference Result 17394 states and 67692 transitions. [2019-11-27 18:47:53,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:47:53,003 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-11-27 18:47:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:53,038 INFO L225 Difference]: With dead ends: 17394 [2019-11-27 18:47:53,038 INFO L226 Difference]: Without dead ends: 17106 [2019-11-27 18:47:53,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-11-27 18:47:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17106 states. [2019-11-27 18:47:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17106 to 13433. [2019-11-27 18:47:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13433 states. [2019-11-27 18:47:53,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13433 states to 13433 states and 53802 transitions. [2019-11-27 18:47:53,271 INFO L78 Accepts]: Start accepts. Automaton has 13433 states and 53802 transitions. Word has length 55 [2019-11-27 18:47:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:53,272 INFO L462 AbstractCegarLoop]: Abstraction has 13433 states and 53802 transitions. [2019-11-27 18:47:53,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 18:47:53,272 INFO L276 IsEmpty]: Start isEmpty. Operand 13433 states and 53802 transitions. [2019-11-27 18:47:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-27 18:47:53,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:53,286 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:53,286 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:53,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:53,286 INFO L82 PathProgramCache]: Analyzing trace with hash -632560242, now seen corresponding path program 2 times [2019-11-27 18:47:53,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:53,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208756985] [2019-11-27 18:47:53,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:53,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208756985] [2019-11-27 18:47:53,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:53,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-27 18:47:53,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100997411] [2019-11-27 18:47:53,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 18:47:53,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:53,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 18:47:53,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-27 18:47:53,865 INFO L87 Difference]: Start difference. First operand 13433 states and 53802 transitions. Second operand 16 states. [2019-11-27 18:47:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:55,481 INFO L93 Difference]: Finished difference Result 17713 states and 69001 transitions. [2019-11-27 18:47:55,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 18:47:55,482 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-11-27 18:47:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:55,516 INFO L225 Difference]: With dead ends: 17713 [2019-11-27 18:47:55,516 INFO L226 Difference]: Without dead ends: 17137 [2019-11-27 18:47:55,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=766, Unknown=0, NotChecked=0, Total=992 [2019-11-27 18:47:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17137 states. [2019-11-27 18:47:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17137 to 13292. [2019-11-27 18:47:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13292 states. [2019-11-27 18:47:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13292 states to 13292 states and 53402 transitions. [2019-11-27 18:47:55,763 INFO L78 Accepts]: Start accepts. Automaton has 13292 states and 53402 transitions. Word has length 55 [2019-11-27 18:47:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:55,764 INFO L462 AbstractCegarLoop]: Abstraction has 13292 states and 53402 transitions. [2019-11-27 18:47:55,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 18:47:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 13292 states and 53402 transitions. [2019-11-27 18:47:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-27 18:47:55,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:55,778 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:55,779 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:55,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:55,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1395487322, now seen corresponding path program 3 times [2019-11-27 18:47:55,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:55,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71625389] [2019-11-27 18:47:55,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:56,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71625389] [2019-11-27 18:47:56,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:56,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-27 18:47:56,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003847899] [2019-11-27 18:47:56,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 18:47:56,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:56,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 18:47:56,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-27 18:47:56,178 INFO L87 Difference]: Start difference. First operand 13292 states and 53402 transitions. Second operand 18 states. [2019-11-27 18:47:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:57,572 INFO L93 Difference]: Finished difference Result 17480 states and 68319 transitions. [2019-11-27 18:47:57,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-27 18:47:57,572 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-11-27 18:47:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:57,607 INFO L225 Difference]: With dead ends: 17480 [2019-11-27 18:47:57,607 INFO L226 Difference]: Without dead ends: 16904 [2019-11-27 18:47:57,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2019-11-27 18:47:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16904 states. [2019-11-27 18:47:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16904 to 12524. [2019-11-27 18:47:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12524 states. [2019-11-27 18:47:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12524 states to 12524 states and 49818 transitions. [2019-11-27 18:47:57,847 INFO L78 Accepts]: Start accepts. Automaton has 12524 states and 49818 transitions. Word has length 55 [2019-11-27 18:47:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:57,847 INFO L462 AbstractCegarLoop]: Abstraction has 12524 states and 49818 transitions. [2019-11-27 18:47:57,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 18:47:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 12524 states and 49818 transitions. [2019-11-27 18:47:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-27 18:47:57,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:57,860 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:57,860 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:47:57,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:57,861 INFO L82 PathProgramCache]: Analyzing trace with hash 208518380, now seen corresponding path program 4 times [2019-11-27 18:47:57,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:47:57,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816309655] [2019-11-27 18:47:57,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:47:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:58,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816309655] [2019-11-27 18:47:58,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:58,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-27 18:47:58,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544039338] [2019-11-27 18:47:58,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 18:47:58,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:47:58,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 18:47:58,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-27 18:47:58,259 INFO L87 Difference]: Start difference. First operand 12524 states and 49818 transitions. Second operand 18 states. [2019-11-27 18:48:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:48:00,225 INFO L93 Difference]: Finished difference Result 11144 states and 43359 transitions. [2019-11-27 18:48:00,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-27 18:48:00,225 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-11-27 18:48:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:48:00,246 INFO L225 Difference]: With dead ends: 11144 [2019-11-27 18:48:00,246 INFO L226 Difference]: Without dead ends: 10568 [2019-11-27 18:48:00,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=520, Invalid=1736, Unknown=0, NotChecked=0, Total=2256 [2019-11-27 18:48:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10568 states. [2019-11-27 18:48:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10568 to 6914. [2019-11-27 18:48:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6914 states. [2019-11-27 18:48:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6914 states to 6914 states and 28315 transitions. [2019-11-27 18:48:00,382 INFO L78 Accepts]: Start accepts. Automaton has 6914 states and 28315 transitions. Word has length 55 [2019-11-27 18:48:00,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:48:00,382 INFO L462 AbstractCegarLoop]: Abstraction has 6914 states and 28315 transitions. [2019-11-27 18:48:00,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 18:48:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 6914 states and 28315 transitions. [2019-11-27 18:48:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-27 18:48:00,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:48:00,393 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:48:00,394 INFO L410 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:48:00,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:48:00,394 INFO L82 PathProgramCache]: Analyzing trace with hash -734287533, now seen corresponding path program 1 times [2019-11-27 18:48:00,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:48:00,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575012094] [2019-11-27 18:48:00,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:48:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:48:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:48:00,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575012094] [2019-11-27 18:48:00,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:48:00,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 18:48:00,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683461914] [2019-11-27 18:48:00,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:48:00,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:48:00,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:48:00,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:48:00,487 INFO L87 Difference]: Start difference. First operand 6914 states and 28315 transitions. Second operand 8 states. [2019-11-27 18:48:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:48:00,698 INFO L93 Difference]: Finished difference Result 6914 states and 28309 transitions. [2019-11-27 18:48:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 18:48:00,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-27 18:48:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:48:00,714 INFO L225 Difference]: With dead ends: 6914 [2019-11-27 18:48:00,715 INFO L226 Difference]: Without dead ends: 6887 [2019-11-27 18:48:00,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:48:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6887 states. [2019-11-27 18:48:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6887 to 6887. [2019-11-27 18:48:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6887 states. [2019-11-27 18:48:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6887 states to 6887 states and 28201 transitions. [2019-11-27 18:48:00,824 INFO L78 Accepts]: Start accepts. Automaton has 6887 states and 28201 transitions. Word has length 88 [2019-11-27 18:48:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:48:00,824 INFO L462 AbstractCegarLoop]: Abstraction has 6887 states and 28201 transitions. [2019-11-27 18:48:00,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:48:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 6887 states and 28201 transitions. [2019-11-27 18:48:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-27 18:48:00,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:48:00,834 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:48:00,834 INFO L410 AbstractCegarLoop]: === Iteration 45 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:48:00,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:48:00,834 INFO L82 PathProgramCache]: Analyzing trace with hash -812593641, now seen corresponding path program 1 times [2019-11-27 18:48:00,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:48:00,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841937570] [2019-11-27 18:48:00,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:48:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:48:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:48:01,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841937570] [2019-11-27 18:48:01,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:48:01,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-27 18:48:01,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367173530] [2019-11-27 18:48:01,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 18:48:01,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:48:01,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 18:48:01,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:48:01,348 INFO L87 Difference]: Start difference. First operand 6887 states and 28201 transitions. Second operand 14 states. [2019-11-27 18:48:01,886 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-11-27 18:48:02,117 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-11-27 18:48:02,303 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-11-27 18:48:02,610 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-11-27 18:48:03,344 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-11-27 18:48:03,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:48:03,486 INFO L93 Difference]: Finished difference Result 9443 states and 38056 transitions. [2019-11-27 18:48:03,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 18:48:03,487 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2019-11-27 18:48:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:48:03,506 INFO L225 Difference]: With dead ends: 9443 [2019-11-27 18:48:03,506 INFO L226 Difference]: Without dead ends: 9335 [2019-11-27 18:48:03,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2019-11-27 18:48:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9335 states. [2019-11-27 18:48:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9335 to 7049. [2019-11-27 18:48:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7049 states. [2019-11-27 18:48:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7049 states to 7049 states and 28759 transitions. [2019-11-27 18:48:03,633 INFO L78 Accepts]: Start accepts. Automaton has 7049 states and 28759 transitions. Word has length 88 [2019-11-27 18:48:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:48:03,633 INFO L462 AbstractCegarLoop]: Abstraction has 7049 states and 28759 transitions. [2019-11-27 18:48:03,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 18:48:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7049 states and 28759 transitions. [2019-11-27 18:48:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-27 18:48:03,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:48:03,646 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:48:03,646 INFO L410 AbstractCegarLoop]: === Iteration 46 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:48:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:48:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash 794295666, now seen corresponding path program 1 times [2019-11-27 18:48:03,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:48:03,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560273849] [2019-11-27 18:48:03,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:48:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:48:03,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:48:03,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560273849] [2019-11-27 18:48:03,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:48:03,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 18:48:03,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173064892] [2019-11-27 18:48:03,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:48:03,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:48:03,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:48:03,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:48:03,742 INFO L87 Difference]: Start difference. First operand 7049 states and 28759 transitions. Second operand 8 states. [2019-11-27 18:48:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:48:03,947 INFO L93 Difference]: Finished difference Result 7049 states and 28753 transitions. [2019-11-27 18:48:03,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 18:48:03,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-27 18:48:03,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:48:03,962 INFO L225 Difference]: With dead ends: 7049 [2019-11-27 18:48:03,962 INFO L226 Difference]: Without dead ends: 6941 [2019-11-27 18:48:03,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:48:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6941 states. [2019-11-27 18:48:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6941 to 6941. [2019-11-27 18:48:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6941 states. [2019-11-27 18:48:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6941 states to 6941 states and 28321 transitions. [2019-11-27 18:48:04,070 INFO L78 Accepts]: Start accepts. Automaton has 6941 states and 28321 transitions. Word has length 88 [2019-11-27 18:48:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:48:04,071 INFO L462 AbstractCegarLoop]: Abstraction has 6941 states and 28321 transitions. [2019-11-27 18:48:04,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:48:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 6941 states and 28321 transitions. [2019-11-27 18:48:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-27 18:48:04,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:48:04,081 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:48:04,081 INFO L410 AbstractCegarLoop]: === Iteration 47 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:48:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:48:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash 755142612, now seen corresponding path program 1 times [2019-11-27 18:48:04,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:48:04,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773784628] [2019-11-27 18:48:04,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:48:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:48:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:48:04,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773784628] [2019-11-27 18:48:04,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:48:04,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-27 18:48:04,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614790465] [2019-11-27 18:48:04,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:48:04,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:48:04,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:48:04,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:48:04,273 INFO L87 Difference]: Start difference. First operand 6941 states and 28321 transitions. Second operand 10 states. [2019-11-27 18:48:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:48:04,710 INFO L93 Difference]: Finished difference Result 6941 states and 28273 transitions. [2019-11-27 18:48:04,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 18:48:04,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-11-27 18:48:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:48:04,725 INFO L225 Difference]: With dead ends: 6941 [2019-11-27 18:48:04,725 INFO L226 Difference]: Without dead ends: 6446 [2019-11-27 18:48:04,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-11-27 18:48:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6446 states. [2019-11-27 18:48:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6446 to 6446. [2019-11-27 18:48:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6446 states. [2019-11-27 18:48:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6446 states to 6446 states and 26161 transitions. [2019-11-27 18:48:04,833 INFO L78 Accepts]: Start accepts. Automaton has 6446 states and 26161 transitions. Word has length 88 [2019-11-27 18:48:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:48:04,833 INFO L462 AbstractCegarLoop]: Abstraction has 6446 states and 26161 transitions. [2019-11-27 18:48:04,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:48:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 6446 states and 26161 transitions. [2019-11-27 18:48:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-27 18:48:04,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:48:04,843 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:48:04,843 INFO L410 AbstractCegarLoop]: === Iteration 48 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:48:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:48:04,843 INFO L82 PathProgramCache]: Analyzing trace with hash -329848485, now seen corresponding path program 1 times [2019-11-27 18:48:04,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:48:04,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316633955] [2019-11-27 18:48:04,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:48:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:48:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:48:04,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316633955] [2019-11-27 18:48:04,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:48:04,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 18:48:04,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11688366] [2019-11-27 18:48:04,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:48:04,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:48:04,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:48:04,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:48:04,972 INFO L87 Difference]: Start difference. First operand 6446 states and 26161 transitions. Second operand 8 states. [2019-11-27 18:48:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:48:05,168 INFO L93 Difference]: Finished difference Result 6446 states and 26155 transitions. [2019-11-27 18:48:05,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 18:48:05,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-27 18:48:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:48:05,181 INFO L225 Difference]: With dead ends: 6446 [2019-11-27 18:48:05,181 INFO L226 Difference]: Without dead ends: 5213 [2019-11-27 18:48:05,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-27 18:48:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5213 states. [2019-11-27 18:48:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5213 to 5213. [2019-11-27 18:48:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5213 states. [2019-11-27 18:48:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5213 states to 5213 states and 21079 transitions. [2019-11-27 18:48:05,261 INFO L78 Accepts]: Start accepts. Automaton has 5213 states and 21079 transitions. Word has length 88 [2019-11-27 18:48:05,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:48:05,261 INFO L462 AbstractCegarLoop]: Abstraction has 5213 states and 21079 transitions. [2019-11-27 18:48:05,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:48:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 5213 states and 21079 transitions. [2019-11-27 18:48:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-27 18:48:05,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:48:05,268 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:48:05,269 INFO L410 AbstractCegarLoop]: === Iteration 49 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-27 18:48:05,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:48:05,269 INFO L82 PathProgramCache]: Analyzing trace with hash -14930375, now seen corresponding path program 1 times [2019-11-27 18:48:05,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:48:05,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664116921] [2019-11-27 18:48:05,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:48:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 18:48:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 18:48:05,359 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 18:48:05,359 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 18:48:05,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 06:48:05 BasicIcfg [2019-11-27 18:48:05,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 18:48:05,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 18:48:05,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 18:48:05,506 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 18:48:05,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:46:16" (3/4) ... [2019-11-27 18:48:05,509 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 18:48:05,637 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 18:48:05,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 18:48:05,641 INFO L168 Benchmark]: Toolchain (without parser) took 110934.96 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 951.0 MB in the beginning and 833.4 MB in the end (delta: 117.6 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-11-27 18:48:05,642 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:48:05,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 956.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2019-11-27 18:48:05,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:48:05,643 INFO L168 Benchmark]: Boogie Preprocessor took 51.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:48:05,644 INFO L168 Benchmark]: RCFGBuilder took 527.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-11-27 18:48:05,645 INFO L168 Benchmark]: TraceAbstraction took 109163.61 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 901.0 MB in the end (delta: 152.6 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-11-27 18:48:05,645 INFO L168 Benchmark]: Witness Printer took 131.91 ms. Allocated memory is still 4.7 GB. Free memory was 901.0 MB in the beginning and 833.4 MB in the end (delta: 67.6 MB). Peak memory consumption was 67.6 MB. Max. memory is 11.5 GB. [2019-11-27 18:48:05,647 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 956.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 527.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 109163.61 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 901.0 MB in the end (delta: 152.6 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 131.91 ms. Allocated memory is still 4.7 GB. Free memory was 901.0 MB in the beginning and 833.4 MB in the end (delta: 67.6 MB). Peak memory consumption was 67.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1089] 0 char *v; VAL [v={0:0}] [L1122] 0 pthread_t t; VAL [v={0:0}] [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={8:0}, t2={9:0}, v={0:0}] [L1124] 0 \read(t) VAL [arg={0:0}, arg={0:0}, t1={8:0}, t2={9:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={0:0}] [L1108] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={0:0}] [L1109] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={0:0}] [L1092] 2 v = malloc(sizeof(char)) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1093] 2 return 0; VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1109] 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1110] 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1097] 3 v[0] = 'X' 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1098] 3 return 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}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1111] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 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}, malloc(sizeof(char))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1112] FCALL, FORK 1 pthread_create(&t4, 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1097] 5 v[0] = 'X' 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1098] 5 return 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1113] 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1097] 6 v[0] = 'X' 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1102] 4 v[0] = 'Y' 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1103] 4 return 0; VAL [\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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1098] 6 return 0; VAL [\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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1114] 1 \read(t2) VAL [\read(t2)=1, \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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1114] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1115] 1 \read(t3) 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1115] 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1116] 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1116] 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1117] 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1117] 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1118] 1 return 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))={1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1118] 1 return 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))={1:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1118] 1 return 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))={1:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1118] 1 return 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))={1:0}, t4={11:0}, t5={6:0}, v={1:0}] [L1118] 1 return 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))={1:0}, t5={6:0}, v={1:0}] [L1118] 1 return 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))={1:0}, v={1:0}] [L1124] 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))={1:0}, v={1:0}] [L1125] 0 v[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))={1:0}, v={1:0}] [L1088] COND TRUE 0 !expression 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))={1:0}, v={1:0}] [L1088] 0 __VERIFIER_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))={1:0}, v={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 error locations. Result: UNSAFE, OverallTime: 108.6s, OverallIterations: 49, TraceHistogramMax: 1, AutomataDifference: 57.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9211 SDtfs, 22609 SDslu, 37290 SDs, 0 SdLazy, 16858 SolverSat, 2876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1188 GetRequests, 152 SyntacticMatches, 65 SemanticMatches, 971 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4138 ImplicationChecksByTransitivity, 33.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47313occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.6s AutomataMinimizationTime, 48 MinimizatonAttempts, 255659 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 2604 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2468 ConstructedInterpolants, 0 QuantifiedInterpolants, 1877096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...