/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:12:01,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:12:01,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:12:01,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:12:01,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:12:01,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:12:01,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:12:01,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:12:01,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:12:01,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:12:01,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:12:01,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:12:01,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:12:01,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:12:01,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:12:01,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:12:01,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:12:01,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:12:01,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:12:01,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:12:01,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:12:01,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:12:01,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:12:01,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:12:01,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:12:01,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:12:01,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:12:01,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:12:01,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:12:01,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:12:01,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:12:01,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:12:01,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:12:01,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:12:01,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:12:01,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:12:01,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:12:01,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:12:01,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:12:01,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:12:01,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:12:01,632 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:12:01,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:12:01,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:12:01,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:12:01,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:12:01,653 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:12:01,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:12:01,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:12:01,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:12:01,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:12:01,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:12:01,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:12:01,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:12:01,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:12:01,655 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:12:01,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:12:01,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:12:01,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:12:01,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:12:01,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:12:01,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:12:01,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:12:01,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:12:01,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:12:01,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:12:01,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:12:01,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:12:01,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:12:01,658 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:12:01,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:12:01,658 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:12:01,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:12:01,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:12:01,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:12:01,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:12:01,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:12:01,954 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:12:01,955 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2019-12-27 15:12:02,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e226d840f/fff79707766f4a559860a0b6b085f543/FLAG6ee7fde0b [2019-12-27 15:12:02,614 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:12:02,615 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2019-12-27 15:12:02,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e226d840f/fff79707766f4a559860a0b6b085f543/FLAG6ee7fde0b [2019-12-27 15:12:02,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e226d840f/fff79707766f4a559860a0b6b085f543 [2019-12-27 15:12:02,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:12:02,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:12:02,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:12:02,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:12:02,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:12:02,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:12:02" (1/1) ... [2019-12-27 15:12:02,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f87c4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:02, skipping insertion in model container [2019-12-27 15:12:02,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:12:02" (1/1) ... [2019-12-27 15:12:02,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:12:02,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:12:03,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:12:03,614 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:12:03,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:12:03,891 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:12:03,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03 WrapperNode [2019-12-27 15:12:03,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:12:03,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:12:03,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:12:03,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:12:03,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:12:03,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:12:03,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:12:03,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:12:03,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:12:03,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:12:03,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:12:03,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:12:03,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (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-12-27 15:12:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:12:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:12:04,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 15:12:04,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2019-12-27 15:12:04,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2019-12-27 15:12:04,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-12-27 15:12:04,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-12-27 15:12:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-12-27 15:12:04,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-12-27 15:12:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-12-27 15:12:04,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-12-27 15:12:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:12:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-27 15:12:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:12:04,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:12:04,073 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:12:04,488 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:12:04,489 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 15:12:04,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:12:04 BoogieIcfgContainer [2019-12-27 15:12:04,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:12:04,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:12:04,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:12:04,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:12:04,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:12:02" (1/3) ... [2019-12-27 15:12:04,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c73e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:12:04, skipping insertion in model container [2019-12-27 15:12:04,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (2/3) ... [2019-12-27 15:12:04,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c73e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:12:04, skipping insertion in model container [2019-12-27 15:12:04,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:12:04" (3/3) ... [2019-12-27 15:12:04,497 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2019-12-27 15:12:04,516 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:12:04,516 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:12:04,526 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 15:12:04,527 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:12:04,566 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,566 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,566 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,566 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,567 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,567 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,567 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,567 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,568 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,568 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,568 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,568 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,569 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,569 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,569 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,569 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,570 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,570 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,570 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,570 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,571 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,572 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,572 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,572 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,572 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,573 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,573 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,573 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,573 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,574 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,574 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,574 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,574 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,575 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,575 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,575 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,575 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,576 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,576 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,576 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,576 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,577 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,577 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,577 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,577 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,577 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,578 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,578 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,578 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,579 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,579 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,579 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,579 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,579 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,580 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,580 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,580 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,580 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,580 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,581 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,581 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,581 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,581 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,581 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,582 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,582 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,582 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,583 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,583 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,583 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,583 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,583 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,585 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,585 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,585 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,586 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,588 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,588 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,589 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,589 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,590 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,590 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,590 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,590 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,590 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,591 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,591 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,591 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,591 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,591 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,592 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,593 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,593 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,593 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,593 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,594 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,594 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,594 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,594 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,594 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,599 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,601 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,601 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,606 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,612 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,612 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,612 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,613 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,615 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,615 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,615 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,615 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,618 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,618 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,618 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,619 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,619 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,619 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,619 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,619 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,620 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,620 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,620 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,620 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,620 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,620 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,621 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,621 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,621 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,621 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,621 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,622 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,622 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,622 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,622 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,622 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,631 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,632 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,632 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,632 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,632 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,633 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,637 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,637 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,637 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,637 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,644 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,644 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,644 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,645 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,645 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,645 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,647 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,647 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,648 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,648 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,652 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,653 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,653 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,653 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,657 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,658 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,658 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,658 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,660 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,661 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,661 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,661 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,872 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-27 15:12:04,889 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:12:04,889 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:12:04,889 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:12:04,889 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:12:04,890 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:12:04,890 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:12:04,890 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:12:04,890 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:12:04,915 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions [2019-12-27 15:12:04,916 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-12-27 15:12:05,033 INFO L132 PetriNetUnfolder]: 61/264 cut-off events. [2019-12-27 15:12:05,034 INFO L133 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2019-12-27 15:12:05,051 INFO L76 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2019-12-27 15:12:05,070 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-12-27 15:12:05,163 INFO L132 PetriNetUnfolder]: 61/264 cut-off events. [2019-12-27 15:12:05,163 INFO L133 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2019-12-27 15:12:05,172 INFO L76 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2019-12-27 15:12:05,185 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4038 [2019-12-27 15:12:05,186 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:12:06,541 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-12-27 15:12:07,059 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 15:12:07,174 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-27 15:12:07,428 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2242 [2019-12-27 15:12:07,428 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2019-12-27 15:12:07,431 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 173 transitions [2019-12-27 15:12:08,000 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2019-12-27 15:12:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2019-12-27 15:12:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:12:08,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:08,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:08,015 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-12-27 15:12:08,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:08,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1385407457, now seen corresponding path program 1 times [2019-12-27 15:12:08,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:08,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955243304] [2019-12-27 15:12:08,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:08,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955243304] [2019-12-27 15:12:08,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:08,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:12:08,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [34312971] [2019-12-27 15:12:08,413 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:08,418 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:08,435 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 13 transitions. [2019-12-27 15:12:08,435 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:08,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:08,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:12:08,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:08,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:12:08,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:12:08,471 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 7 states. [2019-12-27 15:12:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:08,888 INFO L93 Difference]: Finished difference Result 4746 states and 19878 transitions. [2019-12-27 15:12:08,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:12:08,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-27 15:12:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:09,001 INFO L225 Difference]: With dead ends: 4746 [2019-12-27 15:12:09,001 INFO L226 Difference]: Without dead ends: 4260 [2019-12-27 15:12:09,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2019-12-27 15:12:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 3008. [2019-12-27 15:12:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2019-12-27 15:12:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2019-12-27 15:12:09,245 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2019-12-27 15:12:09,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:09,246 INFO L462 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2019-12-27 15:12:09,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:12:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2019-12-27 15:12:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:12:09,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:09,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:09,248 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-12-27 15:12:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:09,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1538202320, now seen corresponding path program 1 times [2019-12-27 15:12:09,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:09,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801563885] [2019-12-27 15:12:09,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:09,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801563885] [2019-12-27 15:12:09,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:09,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:12:09,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [242095819] [2019-12-27 15:12:09,344 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:09,347 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:09,353 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 15:12:09,354 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:09,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:09,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:12:09,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:09,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:12:09,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:12:09,357 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2019-12-27 15:12:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:09,462 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2019-12-27 15:12:09,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:12:09,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 15:12:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:09,495 INFO L225 Difference]: With dead ends: 4848 [2019-12-27 15:12:09,495 INFO L226 Difference]: Without dead ends: 3558 [2019-12-27 15:12:09,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:12:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2019-12-27 15:12:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2019-12-27 15:12:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-12-27 15:12:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2019-12-27 15:12:09,625 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2019-12-27 15:12:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:09,626 INFO L462 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2019-12-27 15:12:09,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:12:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2019-12-27 15:12:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:12:09,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:09,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:09,628 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-12-27 15:12:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash 439630726, now seen corresponding path program 1 times [2019-12-27 15:12:09,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:09,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092005277] [2019-12-27 15:12:09,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:09,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092005277] [2019-12-27 15:12:09,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:09,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:12:09,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1456506064] [2019-12-27 15:12:09,723 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:09,726 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:09,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 36 transitions. [2019-12-27 15:12:09,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:09,731 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:09,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:12:09,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:09,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:12:09,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:12:09,732 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 7 states. [2019-12-27 15:12:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:10,110 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2019-12-27 15:12:10,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:12:10,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-27 15:12:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:10,150 INFO L225 Difference]: With dead ends: 4417 [2019-12-27 15:12:10,151 INFO L226 Difference]: Without dead ends: 4393 [2019-12-27 15:12:10,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2019-12-27 15:12:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2019-12-27 15:12:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-12-27 15:12:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2019-12-27 15:12:10,305 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2019-12-27 15:12:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:10,305 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2019-12-27 15:12:10,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:12:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2019-12-27 15:12:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:12:10,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:10,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:10,308 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-12-27 15:12:10,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:10,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1784829996, now seen corresponding path program 2 times [2019-12-27 15:12:10,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:10,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524668073] [2019-12-27 15:12:10,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:10,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524668073] [2019-12-27 15:12:10,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:10,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:12:10,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [339233199] [2019-12-27 15:12:10,389 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:10,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:10,395 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 23 transitions. [2019-12-27 15:12:10,395 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:10,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:12:10,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:12:10,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:10,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:12:10,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:12:10,411 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 7 states. [2019-12-27 15:12:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:10,600 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2019-12-27 15:12:10,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:12:10,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-27 15:12:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:10,619 INFO L225 Difference]: With dead ends: 4024 [2019-12-27 15:12:10,619 INFO L226 Difference]: Without dead ends: 4024 [2019-12-27 15:12:10,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:12:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2019-12-27 15:12:10,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2019-12-27 15:12:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2019-12-27 15:12:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2019-12-27 15:12:10,751 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2019-12-27 15:12:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:10,752 INFO L462 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2019-12-27 15:12:10,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:12:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2019-12-27 15:12:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 15:12:10,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:10,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:10,754 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-12-27 15:12:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:10,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2096337026, now seen corresponding path program 1 times [2019-12-27 15:12:10,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:10,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125708225] [2019-12-27 15:12:10,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:10,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125708225] [2019-12-27 15:12:10,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:10,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:12:10,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1792537135] [2019-12-27 15:12:10,835 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:10,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:10,895 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 33 transitions. [2019-12-27 15:12:10,895 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:10,897 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:10,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:12:10,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:10,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:12:10,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:12:10,898 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 7 states. [2019-12-27 15:12:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:11,176 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2019-12-27 15:12:11,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:12:11,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 15:12:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:11,196 INFO L225 Difference]: With dead ends: 4225 [2019-12-27 15:12:11,196 INFO L226 Difference]: Without dead ends: 4129 [2019-12-27 15:12:11,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2019-12-27 15:12:11,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2019-12-27 15:12:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2019-12-27 15:12:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2019-12-27 15:12:11,320 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2019-12-27 15:12:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:11,320 INFO L462 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2019-12-27 15:12:11,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:12:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2019-12-27 15:12:11,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 15:12:11,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:11,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:11,322 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-12-27 15:12:11,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:11,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1440753652, now seen corresponding path program 2 times [2019-12-27 15:12:11,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:11,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487111959] [2019-12-27 15:12:11,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:11,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487111959] [2019-12-27 15:12:11,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:11,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:12:11,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1173646673] [2019-12-27 15:12:11,464 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:11,467 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:11,469 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 22 transitions. [2019-12-27 15:12:11,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:11,471 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:11,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:12:11,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:11,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:12:11,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:11,472 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2019-12-27 15:12:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:12,111 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2019-12-27 15:12:12,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:12,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-27 15:12:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:12,137 INFO L225 Difference]: With dead ends: 4979 [2019-12-27 15:12:12,138 INFO L226 Difference]: Without dead ends: 4905 [2019-12-27 15:12:12,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:12:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-12-27 15:12:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2019-12-27 15:12:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2019-12-27 15:12:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2019-12-27 15:12:12,278 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2019-12-27 15:12:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:12,278 INFO L462 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2019-12-27 15:12:12,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:12:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2019-12-27 15:12:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 15:12:12,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:12,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:12,281 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-12-27 15:12:12,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:12,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2054209068, now seen corresponding path program 3 times [2019-12-27 15:12:12,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:12,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873396031] [2019-12-27 15:12:12,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:12,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873396031] [2019-12-27 15:12:12,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:12,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:12:12,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1302037166] [2019-12-27 15:12:12,421 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:12,424 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:12,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 15:12:12,428 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:12,439 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:12,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:12:12,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:12,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:12:12,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:12,441 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 10 states. [2019-12-27 15:12:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:12,937 INFO L93 Difference]: Finished difference Result 5390 states and 21925 transitions. [2019-12-27 15:12:12,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:12,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-27 15:12:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:12,957 INFO L225 Difference]: With dead ends: 5390 [2019-12-27 15:12:12,958 INFO L226 Difference]: Without dead ends: 5316 [2019-12-27 15:12:12,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:12:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2019-12-27 15:12:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4125. [2019-12-27 15:12:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2019-12-27 15:12:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 16604 transitions. [2019-12-27 15:12:13,125 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 16604 transitions. Word has length 18 [2019-12-27 15:12:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:13,125 INFO L462 AbstractCegarLoop]: Abstraction has 4125 states and 16604 transitions. [2019-12-27 15:12:13,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:12:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 16604 transitions. [2019-12-27 15:12:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 15:12:13,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:13,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:13,128 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-12-27 15:12:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1150446370, now seen corresponding path program 4 times [2019-12-27 15:12:13,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:13,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821227673] [2019-12-27 15:12:13,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:13,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821227673] [2019-12-27 15:12:13,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:13,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:12:13,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1339600621] [2019-12-27 15:12:13,455 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:13,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:13,460 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 20 transitions. [2019-12-27 15:12:13,460 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:13,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:13,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:12:13,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:13,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:12:13,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:13,462 INFO L87 Difference]: Start difference. First operand 4125 states and 16604 transitions. Second operand 11 states. [2019-12-27 15:12:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:14,360 INFO L93 Difference]: Finished difference Result 5686 states and 23415 transitions. [2019-12-27 15:12:14,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:12:14,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-12-27 15:12:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:14,376 INFO L225 Difference]: With dead ends: 5686 [2019-12-27 15:12:14,376 INFO L226 Difference]: Without dead ends: 5630 [2019-12-27 15:12:14,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:12:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2019-12-27 15:12:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4116. [2019-12-27 15:12:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2019-12-27 15:12:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2019-12-27 15:12:14,527 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2019-12-27 15:12:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:14,528 INFO L462 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2019-12-27 15:12:14,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:12:14,529 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2019-12-27 15:12:14,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 15:12:14,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:14,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:14,531 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-12-27 15:12:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:14,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1529508729, now seen corresponding path program 1 times [2019-12-27 15:12:14,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:14,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279242389] [2019-12-27 15:12:14,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:14,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279242389] [2019-12-27 15:12:14,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:14,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:12:14,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2125301719] [2019-12-27 15:12:14,620 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:14,622 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:14,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 33 transitions. [2019-12-27 15:12:14,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:14,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:12:14,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:12:14,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:14,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:12:14,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:12:14,659 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 9 states. [2019-12-27 15:12:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:14,906 INFO L93 Difference]: Finished difference Result 4625 states and 18119 transitions. [2019-12-27 15:12:14,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:12:14,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 15:12:14,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:14,920 INFO L225 Difference]: With dead ends: 4625 [2019-12-27 15:12:14,920 INFO L226 Difference]: Without dead ends: 4625 [2019-12-27 15:12:14,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2019-12-27 15:12:15,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4078. [2019-12-27 15:12:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2019-12-27 15:12:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2019-12-27 15:12:15,034 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2019-12-27 15:12:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:15,034 INFO L462 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2019-12-27 15:12:15,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:12:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2019-12-27 15:12:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 15:12:15,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:15,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:15,037 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-12-27 15:12:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash 386755117, now seen corresponding path program 1 times [2019-12-27 15:12:15,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:15,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75987238] [2019-12-27 15:12:15,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:15,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75987238] [2019-12-27 15:12:15,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:15,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 15:12:15,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1743870644] [2019-12-27 15:12:15,310 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:15,312 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:15,316 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 23 transitions. [2019-12-27 15:12:15,316 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:15,317 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:15,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:12:15,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:15,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:12:15,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:15,318 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 12 states. [2019-12-27 15:12:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:16,390 INFO L93 Difference]: Finished difference Result 5865 states and 24362 transitions. [2019-12-27 15:12:16,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:12:16,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 15:12:16,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:16,406 INFO L225 Difference]: With dead ends: 5865 [2019-12-27 15:12:16,406 INFO L226 Difference]: Without dead ends: 5791 [2019-12-27 15:12:16,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:12:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2019-12-27 15:12:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 4021. [2019-12-27 15:12:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2019-12-27 15:12:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 16226 transitions. [2019-12-27 15:12:16,586 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 16226 transitions. Word has length 19 [2019-12-27 15:12:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:16,586 INFO L462 AbstractCegarLoop]: Abstraction has 4021 states and 16226 transitions. [2019-12-27 15:12:16,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:12:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 16226 transitions. [2019-12-27 15:12:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 15:12:16,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:16,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:16,589 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-12-27 15:12:16,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:16,590 INFO L82 PathProgramCache]: Analyzing trace with hash 169969073, now seen corresponding path program 1 times [2019-12-27 15:12:16,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:16,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353937033] [2019-12-27 15:12:16,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:16,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353937033] [2019-12-27 15:12:16,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:16,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:12:16,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1097929365] [2019-12-27 15:12:16,773 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:16,775 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:16,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 38 transitions. [2019-12-27 15:12:16,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:16,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:16,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:12:16,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:16,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:12:16,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:16,783 INFO L87 Difference]: Start difference. First operand 4021 states and 16226 transitions. Second operand 10 states. [2019-12-27 15:12:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:17,320 INFO L93 Difference]: Finished difference Result 5436 states and 21881 transitions. [2019-12-27 15:12:17,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:12:17,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-27 15:12:17,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:17,333 INFO L225 Difference]: With dead ends: 5436 [2019-12-27 15:12:17,334 INFO L226 Difference]: Without dead ends: 5390 [2019-12-27 15:12:17,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:12:17,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5390 states. [2019-12-27 15:12:17,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5390 to 4174. [2019-12-27 15:12:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-12-27 15:12:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 16952 transitions. [2019-12-27 15:12:17,455 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 16952 transitions. Word has length 20 [2019-12-27 15:12:17,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:17,455 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 16952 transitions. [2019-12-27 15:12:17,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:12:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 16952 transitions. [2019-12-27 15:12:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 15:12:17,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:17,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:17,459 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-12-27 15:12:17,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:17,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1932078158, now seen corresponding path program 1 times [2019-12-27 15:12:17,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:17,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844276825] [2019-12-27 15:12:17,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:17,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844276825] [2019-12-27 15:12:17,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:17,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:12:17,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1725170195] [2019-12-27 15:12:17,605 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:17,608 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:17,611 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 22 transitions. [2019-12-27 15:12:17,611 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:17,612 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:17,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:12:17,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:17,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:12:17,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:17,614 INFO L87 Difference]: Start difference. First operand 4174 states and 16952 transitions. Second operand 10 states. [2019-12-27 15:12:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:17,942 INFO L93 Difference]: Finished difference Result 5508 states and 22462 transitions. [2019-12-27 15:12:17,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:12:17,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-27 15:12:17,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:17,956 INFO L225 Difference]: With dead ends: 5508 [2019-12-27 15:12:17,956 INFO L226 Difference]: Without dead ends: 5462 [2019-12-27 15:12:17,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:12:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5462 states. [2019-12-27 15:12:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5462 to 4020. [2019-12-27 15:12:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2019-12-27 15:12:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 16223 transitions. [2019-12-27 15:12:18,126 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 16223 transitions. Word has length 20 [2019-12-27 15:12:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:18,126 INFO L462 AbstractCegarLoop]: Abstraction has 4020 states and 16223 transitions. [2019-12-27 15:12:18,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:12:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 16223 transitions. [2019-12-27 15:12:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 15:12:18,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:18,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:18,130 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-12-27 15:12:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash -944906415, now seen corresponding path program 2 times [2019-12-27 15:12:18,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:18,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207906707] [2019-12-27 15:12:18,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:18,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207906707] [2019-12-27 15:12:18,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:18,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:12:18,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [690470564] [2019-12-27 15:12:18,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:18,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:18,450 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 38 transitions. [2019-12-27 15:12:18,450 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:18,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:18,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:12:18,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:18,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:12:18,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:18,456 INFO L87 Difference]: Start difference. First operand 4020 states and 16223 transitions. Second operand 10 states. [2019-12-27 15:12:19,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:19,485 INFO L93 Difference]: Finished difference Result 5427 states and 21857 transitions. [2019-12-27 15:12:19,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:19,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-27 15:12:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:19,500 INFO L225 Difference]: With dead ends: 5427 [2019-12-27 15:12:19,500 INFO L226 Difference]: Without dead ends: 5381 [2019-12-27 15:12:19,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:12:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-12-27 15:12:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4169. [2019-12-27 15:12:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4169 states. [2019-12-27 15:12:19,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 16935 transitions. [2019-12-27 15:12:19,620 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 16935 transitions. Word has length 20 [2019-12-27 15:12:19,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:19,621 INFO L462 AbstractCegarLoop]: Abstraction has 4169 states and 16935 transitions. [2019-12-27 15:12:19,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:12:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 16935 transitions. [2019-12-27 15:12:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 15:12:19,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:19,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:19,624 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-12-27 15:12:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:19,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1562884562, now seen corresponding path program 2 times [2019-12-27 15:12:19,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:19,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573399733] [2019-12-27 15:12:19,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:19,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573399733] [2019-12-27 15:12:19,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:19,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:12:19,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903092192] [2019-12-27 15:12:19,816 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:19,818 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:19,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 26 transitions. [2019-12-27 15:12:19,822 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:19,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:19,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:12:19,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:19,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:12:19,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:19,838 INFO L87 Difference]: Start difference. First operand 4169 states and 16935 transitions. Second operand 11 states. [2019-12-27 15:12:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:20,606 INFO L93 Difference]: Finished difference Result 5482 states and 22391 transitions. [2019-12-27 15:12:20,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:12:20,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-12-27 15:12:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:20,622 INFO L225 Difference]: With dead ends: 5482 [2019-12-27 15:12:20,622 INFO L226 Difference]: Without dead ends: 5436 [2019-12-27 15:12:20,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:12:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2019-12-27 15:12:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 4013. [2019-12-27 15:12:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2019-12-27 15:12:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16202 transitions. [2019-12-27 15:12:20,774 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16202 transitions. Word has length 20 [2019-12-27 15:12:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:20,774 INFO L462 AbstractCegarLoop]: Abstraction has 4013 states and 16202 transitions. [2019-12-27 15:12:20,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:12:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16202 transitions. [2019-12-27 15:12:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 15:12:20,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:20,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:20,777 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-12-27 15:12:20,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:20,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1961766501, now seen corresponding path program 3 times [2019-12-27 15:12:20,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:20,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303395895] [2019-12-27 15:12:20,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:20,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303395895] [2019-12-27 15:12:20,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:20,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:12:20,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1985582008] [2019-12-27 15:12:20,877 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:20,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:20,884 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 42 transitions. [2019-12-27 15:12:20,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:20,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:20,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:12:20,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:20,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:12:20,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:12:20,895 INFO L87 Difference]: Start difference. First operand 4013 states and 16202 transitions. Second operand 9 states. [2019-12-27 15:12:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:21,304 INFO L93 Difference]: Finished difference Result 5402 states and 21806 transitions. [2019-12-27 15:12:21,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:12:21,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-12-27 15:12:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:21,320 INFO L225 Difference]: With dead ends: 5402 [2019-12-27 15:12:21,320 INFO L226 Difference]: Without dead ends: 5356 [2019-12-27 15:12:21,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:12:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5356 states. [2019-12-27 15:12:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5356 to 3983. [2019-12-27 15:12:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2019-12-27 15:12:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 16133 transitions. [2019-12-27 15:12:21,415 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 16133 transitions. Word has length 20 [2019-12-27 15:12:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:21,415 INFO L462 AbstractCegarLoop]: Abstraction has 3983 states and 16133 transitions. [2019-12-27 15:12:21,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:12:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 16133 transitions. [2019-12-27 15:12:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 15:12:21,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:21,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:21,418 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-12-27 15:12:21,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:21,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2117723117, now seen corresponding path program 1 times [2019-12-27 15:12:21,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:21,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561265957] [2019-12-27 15:12:21,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:21,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561265957] [2019-12-27 15:12:21,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:21,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:12:21,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [471487906] [2019-12-27 15:12:21,478 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:21,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:21,487 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 40 transitions. [2019-12-27 15:12:21,487 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:21,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:21,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:12:21,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:21,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:12:21,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:12:21,493 INFO L87 Difference]: Start difference. First operand 3983 states and 16133 transitions. Second operand 7 states. [2019-12-27 15:12:21,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:21,674 INFO L93 Difference]: Finished difference Result 4762 states and 18800 transitions. [2019-12-27 15:12:21,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:12:21,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-27 15:12:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:21,685 INFO L225 Difference]: With dead ends: 4762 [2019-12-27 15:12:21,685 INFO L226 Difference]: Without dead ends: 4687 [2019-12-27 15:12:21,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2019-12-27 15:12:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4305. [2019-12-27 15:12:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2019-12-27 15:12:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 17320 transitions. [2019-12-27 15:12:21,759 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 17320 transitions. Word has length 21 [2019-12-27 15:12:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:21,760 INFO L462 AbstractCegarLoop]: Abstraction has 4305 states and 17320 transitions. [2019-12-27 15:12:21,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:12:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 17320 transitions. [2019-12-27 15:12:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 15:12:21,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:21,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:21,762 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-12-27 15:12:21,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1335103446, now seen corresponding path program 1 times [2019-12-27 15:12:21,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:21,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899935376] [2019-12-27 15:12:21,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:21,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899935376] [2019-12-27 15:12:21,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:21,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:12:21,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1570561878] [2019-12-27 15:12:21,885 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:21,886 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:21,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 23 transitions. [2019-12-27 15:12:21,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:21,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:21,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:12:21,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:21,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:12:21,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:21,891 INFO L87 Difference]: Start difference. First operand 4305 states and 17320 transitions. Second operand 8 states. [2019-12-27 15:12:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:22,047 INFO L93 Difference]: Finished difference Result 4856 states and 18991 transitions. [2019-12-27 15:12:22,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:12:22,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-27 15:12:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:22,058 INFO L225 Difference]: With dead ends: 4856 [2019-12-27 15:12:22,058 INFO L226 Difference]: Without dead ends: 4329 [2019-12-27 15:12:22,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2019-12-27 15:12:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 3712. [2019-12-27 15:12:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3712 states. [2019-12-27 15:12:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 14646 transitions. [2019-12-27 15:12:22,184 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 14646 transitions. Word has length 21 [2019-12-27 15:12:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:22,185 INFO L462 AbstractCegarLoop]: Abstraction has 3712 states and 14646 transitions. [2019-12-27 15:12:22,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:12:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 14646 transitions. [2019-12-27 15:12:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 15:12:22,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:22,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:22,187 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-12-27 15:12:22,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1959403642, now seen corresponding path program 1 times [2019-12-27 15:12:22,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:22,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618731705] [2019-12-27 15:12:22,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:22,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618731705] [2019-12-27 15:12:22,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:22,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 15:12:22,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1487658242] [2019-12-27 15:12:22,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:22,533 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:22,537 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 25 transitions. [2019-12-27 15:12:22,537 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:22,538 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:22,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:12:22,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:22,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:12:22,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:22,540 INFO L87 Difference]: Start difference. First operand 3712 states and 14646 transitions. Second operand 12 states. [2019-12-27 15:12:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:23,410 INFO L93 Difference]: Finished difference Result 4906 states and 19112 transitions. [2019-12-27 15:12:23,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:23,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 15:12:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:23,421 INFO L225 Difference]: With dead ends: 4906 [2019-12-27 15:12:23,422 INFO L226 Difference]: Without dead ends: 4857 [2019-12-27 15:12:23,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:12:23,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2019-12-27 15:12:23,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 3488. [2019-12-27 15:12:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2019-12-27 15:12:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 13508 transitions. [2019-12-27 15:12:23,484 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 13508 transitions. Word has length 21 [2019-12-27 15:12:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:23,484 INFO L462 AbstractCegarLoop]: Abstraction has 3488 states and 13508 transitions. [2019-12-27 15:12:23,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:12:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 13508 transitions. [2019-12-27 15:12:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 15:12:23,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:23,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:23,487 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-12-27 15:12:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1977277281, now seen corresponding path program 1 times [2019-12-27 15:12:23,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:23,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344268239] [2019-12-27 15:12:23,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:23,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344268239] [2019-12-27 15:12:23,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:23,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:12:23,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1427196935] [2019-12-27 15:12:23,769 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:23,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:23,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 27 transitions. [2019-12-27 15:12:23,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:23,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:23,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:12:23,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:23,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:12:23,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:23,776 INFO L87 Difference]: Start difference. First operand 3488 states and 13508 transitions. Second operand 11 states. [2019-12-27 15:12:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:24,579 INFO L93 Difference]: Finished difference Result 4464 states and 17193 transitions. [2019-12-27 15:12:24,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:24,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 15:12:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:24,590 INFO L225 Difference]: With dead ends: 4464 [2019-12-27 15:12:24,590 INFO L226 Difference]: Without dead ends: 4415 [2019-12-27 15:12:24,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:12:24,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2019-12-27 15:12:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 3330. [2019-12-27 15:12:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2019-12-27 15:12:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 12802 transitions. [2019-12-27 15:12:24,653 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 12802 transitions. Word has length 21 [2019-12-27 15:12:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:24,653 INFO L462 AbstractCegarLoop]: Abstraction has 3330 states and 12802 transitions. [2019-12-27 15:12:24,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:12:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 12802 transitions. [2019-12-27 15:12:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 15:12:24,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:24,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:24,656 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-12-27 15:12:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash -430854838, now seen corresponding path program 1 times [2019-12-27 15:12:24,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:24,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314865726] [2019-12-27 15:12:24,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:25,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314865726] [2019-12-27 15:12:25,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:25,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 15:12:25,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1353745048] [2019-12-27 15:12:25,093 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:25,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:25,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 29 transitions. [2019-12-27 15:12:25,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:25,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:25,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:12:25,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:25,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:12:25,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:25,102 INFO L87 Difference]: Start difference. First operand 3330 states and 12802 transitions. Second operand 12 states. [2019-12-27 15:12:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:25,955 INFO L93 Difference]: Finished difference Result 3991 states and 15112 transitions. [2019-12-27 15:12:25,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:12:25,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 15:12:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:25,965 INFO L225 Difference]: With dead ends: 3991 [2019-12-27 15:12:25,965 INFO L226 Difference]: Without dead ends: 3835 [2019-12-27 15:12:25,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:12:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2019-12-27 15:12:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 2831. [2019-12-27 15:12:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2019-12-27 15:12:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2019-12-27 15:12:26,016 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2019-12-27 15:12:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:26,016 INFO L462 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2019-12-27 15:12:26,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:12:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2019-12-27 15:12:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:12:26,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:26,018 INFO L411 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] [2019-12-27 15:12:26,018 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-12-27 15:12:26,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:26,019 INFO L82 PathProgramCache]: Analyzing trace with hash 641940987, now seen corresponding path program 1 times [2019-12-27 15:12:26,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:26,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255840829] [2019-12-27 15:12:26,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:26,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255840829] [2019-12-27 15:12:26,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:26,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:12:26,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1932710568] [2019-12-27 15:12:26,134 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:26,136 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:26,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 42 transitions. [2019-12-27 15:12:26,141 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:26,142 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:12:26,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:12:26,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:26,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:12:26,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:26,143 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2019-12-27 15:12:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:26,563 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2019-12-27 15:12:26,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:26,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 15:12:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:26,573 INFO L225 Difference]: With dead ends: 3550 [2019-12-27 15:12:26,573 INFO L226 Difference]: Without dead ends: 3490 [2019-12-27 15:12:26,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:12:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2019-12-27 15:12:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2019-12-27 15:12:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2019-12-27 15:12:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2019-12-27 15:12:26,623 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2019-12-27 15:12:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:26,623 INFO L462 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2019-12-27 15:12:26,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:12:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2019-12-27 15:12:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:12:26,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:26,626 INFO L411 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] [2019-12-27 15:12:26,626 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-12-27 15:12:26,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:26,626 INFO L82 PathProgramCache]: Analyzing trace with hash -109833189, now seen corresponding path program 2 times [2019-12-27 15:12:26,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:26,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105836788] [2019-12-27 15:12:26,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:26,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105836788] [2019-12-27 15:12:26,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:26,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:12:26,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569903038] [2019-12-27 15:12:26,786 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:26,789 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:26,794 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 15:12:26,795 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:26,797 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:26,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:12:26,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:12:26,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:12:26,804 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2019-12-27 15:12:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:27,273 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2019-12-27 15:12:27,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:12:27,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 15:12:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:27,283 INFO L225 Difference]: With dead ends: 3862 [2019-12-27 15:12:27,283 INFO L226 Difference]: Without dead ends: 3802 [2019-12-27 15:12:27,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:12:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2019-12-27 15:12:27,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2019-12-27 15:12:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-27 15:12:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2019-12-27 15:12:27,331 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2019-12-27 15:12:27,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:27,331 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2019-12-27 15:12:27,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:12:27,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2019-12-27 15:12:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:12:27,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:27,333 INFO L411 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] [2019-12-27 15:12:27,333 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-12-27 15:12:27,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:27,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1541949331, now seen corresponding path program 3 times [2019-12-27 15:12:27,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:27,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527807871] [2019-12-27 15:12:27,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:27,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527807871] [2019-12-27 15:12:27,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:27,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:12:27,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5578513] [2019-12-27 15:12:27,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:27,493 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:27,499 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 52 transitions. [2019-12-27 15:12:27,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:27,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:12:27,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:12:27,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:27,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:12:27,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:27,519 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 11 states. [2019-12-27 15:12:28,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:28,024 INFO L93 Difference]: Finished difference Result 3439 states and 12673 transitions. [2019-12-27 15:12:28,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:28,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-27 15:12:28,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:28,032 INFO L225 Difference]: With dead ends: 3439 [2019-12-27 15:12:28,032 INFO L226 Difference]: Without dead ends: 3379 [2019-12-27 15:12:28,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:12:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2019-12-27 15:12:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 2730. [2019-12-27 15:12:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2019-12-27 15:12:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10232 transitions. [2019-12-27 15:12:28,082 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10232 transitions. Word has length 22 [2019-12-27 15:12:28,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:28,082 INFO L462 AbstractCegarLoop]: Abstraction has 2730 states and 10232 transitions. [2019-12-27 15:12:28,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:12:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10232 transitions. [2019-12-27 15:12:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:12:28,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:28,084 INFO L411 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] [2019-12-27 15:12:28,085 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-12-27 15:12:28,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:28,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1025373391, now seen corresponding path program 4 times [2019-12-27 15:12:28,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:28,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014409539] [2019-12-27 15:12:28,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:28,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014409539] [2019-12-27 15:12:28,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:28,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:12:28,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1901356641] [2019-12-27 15:12:28,332 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:28,334 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:28,338 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 32 transitions. [2019-12-27 15:12:28,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:28,339 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:28,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:12:28,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:28,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:12:28,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:28,340 INFO L87 Difference]: Start difference. First operand 2730 states and 10232 transitions. Second operand 11 states. [2019-12-27 15:12:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:28,914 INFO L93 Difference]: Finished difference Result 3588 states and 13121 transitions. [2019-12-27 15:12:28,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:12:28,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-27 15:12:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:28,922 INFO L225 Difference]: With dead ends: 3588 [2019-12-27 15:12:28,922 INFO L226 Difference]: Without dead ends: 3528 [2019-12-27 15:12:28,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:12:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2019-12-27 15:12:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2670. [2019-12-27 15:12:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2019-12-27 15:12:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2019-12-27 15:12:28,967 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2019-12-27 15:12:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:28,967 INFO L462 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2019-12-27 15:12:28,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:12:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2019-12-27 15:12:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 15:12:28,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:28,969 INFO L411 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] [2019-12-27 15:12:28,969 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-12-27 15:12:28,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:28,970 INFO L82 PathProgramCache]: Analyzing trace with hash -230669277, now seen corresponding path program 1 times [2019-12-27 15:12:28,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:28,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558064667] [2019-12-27 15:12:28,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:29,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558064667] [2019-12-27 15:12:29,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:29,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 15:12:29,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [944074555] [2019-12-27 15:12:29,366 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:29,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:29,371 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 31 transitions. [2019-12-27 15:12:29,372 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:29,372 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:29,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:12:29,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:29,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:12:29,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:29,373 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2019-12-27 15:12:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:30,247 INFO L93 Difference]: Finished difference Result 3103 states and 11113 transitions. [2019-12-27 15:12:30,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:12:30,247 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 15:12:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:30,255 INFO L225 Difference]: With dead ends: 3103 [2019-12-27 15:12:30,255 INFO L226 Difference]: Without dead ends: 3007 [2019-12-27 15:12:30,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:12:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2019-12-27 15:12:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2170. [2019-12-27 15:12:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-12-27 15:12:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2019-12-27 15:12:30,306 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 23 [2019-12-27 15:12:30,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:30,306 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2019-12-27 15:12:30,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:12:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2019-12-27 15:12:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 15:12:30,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:30,309 INFO L411 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] [2019-12-27 15:12:30,309 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-12-27 15:12:30,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:30,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1022800040, now seen corresponding path program 1 times [2019-12-27 15:12:30,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:30,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661897091] [2019-12-27 15:12:30,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:30,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661897091] [2019-12-27 15:12:30,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:30,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:12:30,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [998385342] [2019-12-27 15:12:30,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:30,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:30,754 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 55 transitions. [2019-12-27 15:12:30,754 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:30,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:12:30,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:12:30,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:30,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:12:30,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:30,765 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 11 states. [2019-12-27 15:12:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:31,361 INFO L93 Difference]: Finished difference Result 2812 states and 10003 transitions. [2019-12-27 15:12:31,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:12:31,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 15:12:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:31,369 INFO L225 Difference]: With dead ends: 2812 [2019-12-27 15:12:31,369 INFO L226 Difference]: Without dead ends: 2755 [2019-12-27 15:12:31,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:12:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-12-27 15:12:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2130. [2019-12-27 15:12:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-12-27 15:12:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7633 transitions. [2019-12-27 15:12:31,402 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7633 transitions. Word has length 23 [2019-12-27 15:12:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:31,403 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 7633 transitions. [2019-12-27 15:12:31,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:12:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7633 transitions. [2019-12-27 15:12:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 15:12:31,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:31,405 INFO L411 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] [2019-12-27 15:12:31,405 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-12-27 15:12:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1539375980, now seen corresponding path program 2 times [2019-12-27 15:12:31,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:31,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388186960] [2019-12-27 15:12:31,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:31,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388186960] [2019-12-27 15:12:31,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:31,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 15:12:31,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1503034590] [2019-12-27 15:12:31,745 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:31,748 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:31,757 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 40 transitions. [2019-12-27 15:12:31,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:31,760 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:12:31,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:12:31,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:31,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:12:31,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:12:31,761 INFO L87 Difference]: Start difference. First operand 2130 states and 7633 transitions. Second operand 13 states. [2019-12-27 15:12:32,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:32,780 INFO L93 Difference]: Finished difference Result 2895 states and 10221 transitions. [2019-12-27 15:12:32,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:12:32,781 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-27 15:12:32,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:32,787 INFO L225 Difference]: With dead ends: 2895 [2019-12-27 15:12:32,787 INFO L226 Difference]: Without dead ends: 2778 [2019-12-27 15:12:32,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:12:32,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2019-12-27 15:12:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 1842. [2019-12-27 15:12:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-12-27 15:12:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 6495 transitions. [2019-12-27 15:12:32,818 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 6495 transitions. Word has length 23 [2019-12-27 15:12:32,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:32,818 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 6495 transitions. [2019-12-27 15:12:32,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:12:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 6495 transitions. [2019-12-27 15:12:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 15:12:32,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:32,820 INFO L411 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] [2019-12-27 15:12:32,820 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-12-27 15:12:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:32,820 INFO L82 PathProgramCache]: Analyzing trace with hash -396779108, now seen corresponding path program 1 times [2019-12-27 15:12:32,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:32,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779475155] [2019-12-27 15:12:32,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:32,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779475155] [2019-12-27 15:12:32,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:32,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:12:32,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418627556] [2019-12-27 15:12:32,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:32,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:32,888 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 59 transitions. [2019-12-27 15:12:32,888 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:32,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:12:32,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:12:32,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:32,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:12:32,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:12:32,892 INFO L87 Difference]: Start difference. First operand 1842 states and 6495 transitions. Second operand 7 states. [2019-12-27 15:12:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:33,108 INFO L93 Difference]: Finished difference Result 2339 states and 7931 transitions. [2019-12-27 15:12:33,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:12:33,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-27 15:12:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:33,113 INFO L225 Difference]: With dead ends: 2339 [2019-12-27 15:12:33,113 INFO L226 Difference]: Without dead ends: 2275 [2019-12-27 15:12:33,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2019-12-27 15:12:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2154. [2019-12-27 15:12:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2019-12-27 15:12:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 7487 transitions. [2019-12-27 15:12:33,144 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 7487 transitions. Word has length 24 [2019-12-27 15:12:33,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:33,144 INFO L462 AbstractCegarLoop]: Abstraction has 2154 states and 7487 transitions. [2019-12-27 15:12:33,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:12:33,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 7487 transitions. [2019-12-27 15:12:33,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 15:12:33,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:33,146 INFO L411 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] [2019-12-27 15:12:33,146 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-12-27 15:12:33,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:33,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1742211423, now seen corresponding path program 1 times [2019-12-27 15:12:33,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:33,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312338213] [2019-12-27 15:12:33,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:33,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312338213] [2019-12-27 15:12:33,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:33,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:12:33,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [545056759] [2019-12-27 15:12:33,272 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:33,277 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:33,286 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 42 transitions. [2019-12-27 15:12:33,286 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:33,292 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:12:33,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:12:33,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:33,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:12:33,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:12:33,294 INFO L87 Difference]: Start difference. First operand 2154 states and 7487 transitions. Second operand 9 states. [2019-12-27 15:12:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:33,793 INFO L93 Difference]: Finished difference Result 3002 states and 10436 transitions. [2019-12-27 15:12:33,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:12:33,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-27 15:12:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:33,800 INFO L225 Difference]: With dead ends: 3002 [2019-12-27 15:12:33,800 INFO L226 Difference]: Without dead ends: 2978 [2019-12-27 15:12:33,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:12:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-12-27 15:12:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2153. [2019-12-27 15:12:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2153 states. [2019-12-27 15:12:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 7486 transitions. [2019-12-27 15:12:33,876 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 7486 transitions. Word has length 24 [2019-12-27 15:12:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:33,877 INFO L462 AbstractCegarLoop]: Abstraction has 2153 states and 7486 transitions. [2019-12-27 15:12:33,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:12:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 7486 transitions. [2019-12-27 15:12:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 15:12:33,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:33,880 INFO L411 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] [2019-12-27 15:12:33,880 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-12-27 15:12:33,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:33,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1800981697, now seen corresponding path program 2 times [2019-12-27 15:12:33,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:33,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308926009] [2019-12-27 15:12:33,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:34,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-12-27 15:12:34,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308926009] [2019-12-27 15:12:34,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:34,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:12:34,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42300261] [2019-12-27 15:12:34,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:34,187 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:34,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 46 transitions. [2019-12-27 15:12:34,197 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:34,201 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:12:34,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:12:34,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:12:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:34,202 INFO L87 Difference]: Start difference. First operand 2153 states and 7486 transitions. Second operand 10 states. [2019-12-27 15:12:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:35,245 INFO L93 Difference]: Finished difference Result 3010 states and 10450 transitions. [2019-12-27 15:12:35,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 15:12:35,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-27 15:12:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:35,252 INFO L225 Difference]: With dead ends: 3010 [2019-12-27 15:12:35,252 INFO L226 Difference]: Without dead ends: 2986 [2019-12-27 15:12:35,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:12:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2019-12-27 15:12:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2156. [2019-12-27 15:12:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2019-12-27 15:12:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 7493 transitions. [2019-12-27 15:12:35,287 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 7493 transitions. Word has length 24 [2019-12-27 15:12:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:35,287 INFO L462 AbstractCegarLoop]: Abstraction has 2156 states and 7493 transitions. [2019-12-27 15:12:35,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:12:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 7493 transitions. [2019-12-27 15:12:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 15:12:35,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:35,289 INFO L411 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] [2019-12-27 15:12:35,290 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-12-27 15:12:35,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:35,290 INFO L82 PathProgramCache]: Analyzing trace with hash 652694931, now seen corresponding path program 3 times [2019-12-27 15:12:35,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:35,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820058243] [2019-12-27 15:12:35,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:35,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820058243] [2019-12-27 15:12:35,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:35,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:12:35,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1187363090] [2019-12-27 15:12:35,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:35,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:35,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 15:12:35,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:35,498 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:12:35,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:12:35,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:35,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:12:35,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:35,499 INFO L87 Difference]: Start difference. First operand 2156 states and 7493 transitions. Second operand 12 states. [2019-12-27 15:12:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:36,034 INFO L93 Difference]: Finished difference Result 2952 states and 10317 transitions. [2019-12-27 15:12:36,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:12:36,034 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-12-27 15:12:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:36,041 INFO L225 Difference]: With dead ends: 2952 [2019-12-27 15:12:36,041 INFO L226 Difference]: Without dead ends: 2928 [2019-12-27 15:12:36,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:12:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2019-12-27 15:12:36,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2134. [2019-12-27 15:12:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2134 states. [2019-12-27 15:12:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 7443 transitions. [2019-12-27 15:12:36,075 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 7443 transitions. Word has length 24 [2019-12-27 15:12:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:36,075 INFO L462 AbstractCegarLoop]: Abstraction has 2134 states and 7443 transitions. [2019-12-27 15:12:36,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:12:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 7443 transitions. [2019-12-27 15:12:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 15:12:36,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:36,077 INFO L411 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] [2019-12-27 15:12:36,078 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-12-27 15:12:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash 351528874, now seen corresponding path program 2 times [2019-12-27 15:12:36,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:36,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891060215] [2019-12-27 15:12:36,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:36,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891060215] [2019-12-27 15:12:36,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:36,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:12:36,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [60945626] [2019-12-27 15:12:36,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:36,189 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:36,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 48 transitions. [2019-12-27 15:12:36,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:36,198 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:12:36,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:12:36,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:36,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:12:36,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:36,199 INFO L87 Difference]: Start difference. First operand 2134 states and 7443 transitions. Second operand 8 states. [2019-12-27 15:12:36,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:36,632 INFO L93 Difference]: Finished difference Result 2628 states and 8874 transitions. [2019-12-27 15:12:36,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:36,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 15:12:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:36,638 INFO L225 Difference]: With dead ends: 2628 [2019-12-27 15:12:36,639 INFO L226 Difference]: Without dead ends: 2564 [2019-12-27 15:12:36,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:12:36,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2019-12-27 15:12:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2131. [2019-12-27 15:12:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-12-27 15:12:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 7438 transitions. [2019-12-27 15:12:36,680 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 7438 transitions. Word has length 24 [2019-12-27 15:12:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:36,681 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 7438 transitions. [2019-12-27 15:12:36,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:12:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 7438 transitions. [2019-12-27 15:12:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 15:12:36,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:36,684 INFO L411 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] [2019-12-27 15:12:36,684 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-12-27 15:12:36,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:36,685 INFO L82 PathProgramCache]: Analyzing trace with hash -548948534, now seen corresponding path program 3 times [2019-12-27 15:12:36,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:36,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450500259] [2019-12-27 15:12:36,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:36,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450500259] [2019-12-27 15:12:36,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:36,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:12:36,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1582724547] [2019-12-27 15:12:36,818 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:36,822 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:36,828 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 50 transitions. [2019-12-27 15:12:36,828 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:36,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:12:36,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:12:36,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:36,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:12:36,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:12:36,831 INFO L87 Difference]: Start difference. First operand 2131 states and 7438 transitions. Second operand 9 states. [2019-12-27 15:12:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:37,307 INFO L93 Difference]: Finished difference Result 2930 states and 9846 transitions. [2019-12-27 15:12:37,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:12:37,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-27 15:12:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:37,314 INFO L225 Difference]: With dead ends: 2930 [2019-12-27 15:12:37,314 INFO L226 Difference]: Without dead ends: 2866 [2019-12-27 15:12:37,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:12:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2019-12-27 15:12:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 2125. [2019-12-27 15:12:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-12-27 15:12:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 7424 transitions. [2019-12-27 15:12:37,403 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 7424 transitions. Word has length 24 [2019-12-27 15:12:37,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:37,403 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 7424 transitions. [2019-12-27 15:12:37,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:12:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 7424 transitions. [2019-12-27 15:12:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 15:12:37,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:37,407 INFO L411 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] [2019-12-27 15:12:37,407 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-12-27 15:12:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:37,408 INFO L82 PathProgramCache]: Analyzing trace with hash -610918652, now seen corresponding path program 4 times [2019-12-27 15:12:37,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:37,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643037764] [2019-12-27 15:12:37,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:37,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643037764] [2019-12-27 15:12:37,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:37,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:12:37,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1805572872] [2019-12-27 15:12:37,684 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:37,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:37,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 15:12:37,695 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:37,711 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:12:37,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:12:37,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:37,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:12:37,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:37,712 INFO L87 Difference]: Start difference. First operand 2125 states and 7424 transitions. Second operand 12 states. [2019-12-27 15:12:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:38,202 INFO L93 Difference]: Finished difference Result 2557 states and 8642 transitions. [2019-12-27 15:12:38,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:38,203 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-12-27 15:12:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:38,209 INFO L225 Difference]: With dead ends: 2557 [2019-12-27 15:12:38,209 INFO L226 Difference]: Without dead ends: 2493 [2019-12-27 15:12:38,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:12:38,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-12-27 15:12:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2073. [2019-12-27 15:12:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2073 states. [2019-12-27 15:12:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 7230 transitions. [2019-12-27 15:12:38,256 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 7230 transitions. Word has length 24 [2019-12-27 15:12:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:38,257 INFO L462 AbstractCegarLoop]: Abstraction has 2073 states and 7230 transitions. [2019-12-27 15:12:38,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:12:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 7230 transitions. [2019-12-27 15:12:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 15:12:38,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:38,260 INFO L411 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] [2019-12-27 15:12:38,260 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-12-27 15:12:38,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:38,260 INFO L82 PathProgramCache]: Analyzing trace with hash -847503804, now seen corresponding path program 5 times [2019-12-27 15:12:38,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:38,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361343892] [2019-12-27 15:12:38,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:38,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361343892] [2019-12-27 15:12:38,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:38,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 15:12:38,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1586360698] [2019-12-27 15:12:38,554 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:38,557 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:38,563 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 38 transitions. [2019-12-27 15:12:38,564 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:38,565 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:12:38,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:12:38,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:38,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:12:38,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:12:38,566 INFO L87 Difference]: Start difference. First operand 2073 states and 7230 transitions. Second operand 13 states. [2019-12-27 15:12:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:39,597 INFO L93 Difference]: Finished difference Result 3052 states and 10341 transitions. [2019-12-27 15:12:39,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:12:39,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-12-27 15:12:39,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:39,604 INFO L225 Difference]: With dead ends: 3052 [2019-12-27 15:12:39,604 INFO L226 Difference]: Without dead ends: 2924 [2019-12-27 15:12:39,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:12:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2019-12-27 15:12:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2005. [2019-12-27 15:12:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-12-27 15:12:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 7054 transitions. [2019-12-27 15:12:39,642 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 7054 transitions. Word has length 24 [2019-12-27 15:12:39,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:39,642 INFO L462 AbstractCegarLoop]: Abstraction has 2005 states and 7054 transitions. [2019-12-27 15:12:39,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:12:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 7054 transitions. [2019-12-27 15:12:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:12:39,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:39,645 INFO L411 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] [2019-12-27 15:12:39,646 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-12-27 15:12:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash 128519362, now seen corresponding path program 1 times [2019-12-27 15:12:39,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:39,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116818655] [2019-12-27 15:12:39,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:39,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116818655] [2019-12-27 15:12:39,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:39,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 15:12:39,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [276777503] [2019-12-27 15:12:39,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:39,981 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:39,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 57 transitions. [2019-12-27 15:12:39,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:39,992 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:12:39,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:12:39,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:39,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:12:39,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:39,993 INFO L87 Difference]: Start difference. First operand 2005 states and 7054 transitions. Second operand 12 states. [2019-12-27 15:12:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:40,769 INFO L93 Difference]: Finished difference Result 2627 states and 9048 transitions. [2019-12-27 15:12:40,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:12:40,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 15:12:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:40,780 INFO L225 Difference]: With dead ends: 2627 [2019-12-27 15:12:40,780 INFO L226 Difference]: Without dead ends: 2604 [2019-12-27 15:12:40,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:12:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2019-12-27 15:12:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 1613. [2019-12-27 15:12:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2019-12-27 15:12:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2019-12-27 15:12:40,810 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 25 [2019-12-27 15:12:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:40,810 INFO L462 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2019-12-27 15:12:40,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:12:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2019-12-27 15:12:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 15:12:40,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:40,812 INFO L411 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] [2019-12-27 15:12:40,812 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-12-27 15:12:40,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:40,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1601368368, now seen corresponding path program 1 times [2019-12-27 15:12:40,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:40,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992028364] [2019-12-27 15:12:40,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:40,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992028364] [2019-12-27 15:12:40,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:40,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:12:40,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [789663104] [2019-12-27 15:12:40,968 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:40,971 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:40,979 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 48 transitions. [2019-12-27 15:12:40,979 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:40,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:12:40,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:12:40,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:12:40,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:40,990 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 10 states. [2019-12-27 15:12:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:41,274 INFO L93 Difference]: Finished difference Result 2230 states and 7382 transitions. [2019-12-27 15:12:41,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:12:41,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-27 15:12:41,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:41,279 INFO L225 Difference]: With dead ends: 2230 [2019-12-27 15:12:41,279 INFO L226 Difference]: Without dead ends: 2208 [2019-12-27 15:12:41,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:12:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-12-27 15:12:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1612. [2019-12-27 15:12:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2019-12-27 15:12:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 5562 transitions. [2019-12-27 15:12:41,304 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 5562 transitions. Word has length 26 [2019-12-27 15:12:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:41,304 INFO L462 AbstractCegarLoop]: Abstraction has 1612 states and 5562 transitions. [2019-12-27 15:12:41,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:12:41,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 5562 transitions. [2019-12-27 15:12:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 15:12:41,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:41,307 INFO L411 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] [2019-12-27 15:12:41,307 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-12-27 15:12:41,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:41,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1793121520, now seen corresponding path program 2 times [2019-12-27 15:12:41,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:41,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464353540] [2019-12-27 15:12:41,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:41,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464353540] [2019-12-27 15:12:41,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:41,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:12:41,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317480111] [2019-12-27 15:12:41,523 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:41,528 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:41,537 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 52 transitions. [2019-12-27 15:12:41,537 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:41,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:12:41,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:12:41,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:41,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:12:41,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:41,541 INFO L87 Difference]: Start difference. First operand 1612 states and 5562 transitions. Second operand 10 states. [2019-12-27 15:12:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:42,401 INFO L93 Difference]: Finished difference Result 2230 states and 7379 transitions. [2019-12-27 15:12:42,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 15:12:42,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-27 15:12:42,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:42,407 INFO L225 Difference]: With dead ends: 2230 [2019-12-27 15:12:42,407 INFO L226 Difference]: Without dead ends: 2208 [2019-12-27 15:12:42,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:12:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-12-27 15:12:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1615. [2019-12-27 15:12:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-12-27 15:12:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 5569 transitions. [2019-12-27 15:12:42,431 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 5569 transitions. Word has length 26 [2019-12-27 15:12:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:42,431 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 5569 transitions. [2019-12-27 15:12:42,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:12:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 5569 transitions. [2019-12-27 15:12:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 15:12:42,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:42,433 INFO L411 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] [2019-12-27 15:12:42,434 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-12-27 15:12:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1731151402, now seen corresponding path program 3 times [2019-12-27 15:12:42,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:42,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109297752] [2019-12-27 15:12:42,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:42,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109297752] [2019-12-27 15:12:42,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:42,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 15:12:42,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575497926] [2019-12-27 15:12:42,649 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:42,652 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:42,661 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 60 transitions. [2019-12-27 15:12:42,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:42,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:12:42,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:12:42,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:42,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:12:42,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:12:42,697 INFO L87 Difference]: Start difference. First operand 1615 states and 5569 transitions. Second operand 13 states. [2019-12-27 15:12:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:43,257 INFO L93 Difference]: Finished difference Result 1290 states and 4386 transitions. [2019-12-27 15:12:43,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:43,258 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-12-27 15:12:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:43,261 INFO L225 Difference]: With dead ends: 1290 [2019-12-27 15:12:43,261 INFO L226 Difference]: Without dead ends: 1246 [2019-12-27 15:12:43,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:12:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-12-27 15:12:43,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 885. [2019-12-27 15:12:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-12-27 15:12:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2019-12-27 15:12:43,276 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2019-12-27 15:12:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:43,276 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2019-12-27 15:12:43,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:12:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2019-12-27 15:12:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:12:43,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:43,278 INFO L411 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] [2019-12-27 15:12:43,278 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-12-27 15:12:43,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash -720297978, now seen corresponding path program 1 times [2019-12-27 15:12:43,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:43,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712107269] [2019-12-27 15:12:43,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:43,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712107269] [2019-12-27 15:12:43,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:43,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:12:43,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621581773] [2019-12-27 15:12:43,361 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:43,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:43,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 189 transitions. [2019-12-27 15:12:43,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:43,401 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:12:43,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:12:43,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:43,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:12:43,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:43,402 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2019-12-27 15:12:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:43,559 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2019-12-27 15:12:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:12:43,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 15:12:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:43,562 INFO L225 Difference]: With dead ends: 885 [2019-12-27 15:12:43,562 INFO L226 Difference]: Without dead ends: 879 [2019-12-27 15:12:43,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-12-27 15:12:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2019-12-27 15:12:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-12-27 15:12:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2019-12-27 15:12:43,575 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2019-12-27 15:12:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:43,575 INFO L462 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2019-12-27 15:12:43,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:12:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2019-12-27 15:12:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:12:43,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:43,577 INFO L411 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] [2019-12-27 15:12:43,577 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-12-27 15:12:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash 525302158, now seen corresponding path program 1 times [2019-12-27 15:12:43,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:43,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758064348] [2019-12-27 15:12:43,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:43,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758064348] [2019-12-27 15:12:43,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:43,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:12:43,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1991471008] [2019-12-27 15:12:43,673 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:43,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:43,720 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 197 transitions. [2019-12-27 15:12:43,720 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:43,722 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:12:43,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:12:43,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:43,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:12:43,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:43,723 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2019-12-27 15:12:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:43,868 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2019-12-27 15:12:43,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:12:43,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 15:12:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:43,872 INFO L225 Difference]: With dead ends: 879 [2019-12-27 15:12:43,872 INFO L226 Difference]: Without dead ends: 819 [2019-12-27 15:12:43,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-12-27 15:12:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2019-12-27 15:12:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-27 15:12:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2019-12-27 15:12:43,884 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2019-12-27 15:12:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:43,884 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2019-12-27 15:12:43,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:12:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2019-12-27 15:12:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:12:43,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:43,886 INFO L411 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] [2019-12-27 15:12:43,886 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-12-27 15:12:43,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:43,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1075124498, now seen corresponding path program 1 times [2019-12-27 15:12:43,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:43,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895831685] [2019-12-27 15:12:43,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:43,954 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:12:43,955 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:12:43,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [467] [467] ULTIMATE.startENTRY-->L1123: Formula: (let ((.cse0 (store |v_#valid_113| 0 0))) (and (= |v_#NULL.offset_4| 0) (= |v_#valid_111| (store .cse0 |v_ULTIMATE.start_main_~#t~0.base_24| 1)) (= |v_ULTIMATE.start_main_~#t~0.offset_20| 0) (= 0 |v_#NULL.base_4|) (= v_~v~0.offset_45 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t~0.base_24|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_main_~#t~0.base_24| (store (select |v_#memory_int_120| |v_ULTIMATE.start_main_~#t~0.base_24|) |v_ULTIMATE.start_main_~#t~0.offset_20| 5)) |v_#memory_int_119|) (< 0 |v_#StackHeapBarrier_22|) (= v_~v~0.base_45 0) (= (store |v_#length_40| |v_ULTIMATE.start_main_~#t~0.base_24| 4) |v_#length_39|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t~0.base_24|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_113|, #memory_int=|v_#memory_int_120|, #length=|v_#length_40|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_9|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_20|, ~v~0.base=v_~v~0.base_45, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~v~0.offset=v_~v~0.offset_45, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_13|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_24|, #length=|v_#length_39|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_25|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, #NULL.offset, ULTIMATE.start_main_~#t~0.offset, ~v~0.base, #NULL.base, ~v~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-12-27 15:12:43,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [464] [464] thread0ENTRY-->L1108: Formula: (let ((.cse3 (store |v_#valid_104| |v_thread0Thread1of1ForFork3_~#t1~0.base_18| 1))) (let ((.cse0 (store .cse3 |v_thread0Thread1of1ForFork3_~#t2~0.base_17| 1))) (let ((.cse2 (store .cse0 |v_thread0Thread1of1ForFork3_~#t3~0.base_18| 1))) (let ((.cse1 (store .cse2 |v_thread0Thread1of1ForFork3_~#t4~0.base_17| 1))) (and (not (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.base_17|)) (= 0 |v_thread0Thread1of1ForFork3_~#t3~0.offset_15|) (= v_thread0Thread1of1ForFork3_~arg.offset_6 |v_thread0Thread1of1ForFork3_#in~arg.offset_6|) (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.offset_13|) (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.offset_14|) (not (= 0 |v_thread0Thread1of1ForFork3_~#t5~0.base_21|)) (= 0 (select .cse0 |v_thread0Thread1of1ForFork3_~#t3~0.base_18|)) (= 0 (select .cse1 |v_thread0Thread1of1ForFork3_~#t5~0.base_21|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t5~0.base_21|) (= (select .cse2 |v_thread0Thread1of1ForFork3_~#t4~0.base_17|) 0) (not (= |v_thread0Thread1of1ForFork3_~#t1~0.base_18| 0)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t2~0.base_17|) (= (store .cse1 |v_thread0Thread1of1ForFork3_~#t5~0.base_21| 1) |v_#valid_102|) (= v_thread0Thread1of1ForFork3_~arg.base_6 |v_thread0Thread1of1ForFork3_#in~arg.base_6|) (not (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.base_17|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t3~0.base_18|) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) (= (store (store (store (store (store |v_#length_38| |v_thread0Thread1of1ForFork3_~#t1~0.base_18| 4) |v_thread0Thread1of1ForFork3_~#t2~0.base_17| 4) |v_thread0Thread1of1ForFork3_~#t3~0.base_18| 4) |v_thread0Thread1of1ForFork3_~#t4~0.base_17| 4) |v_thread0Thread1of1ForFork3_~#t5~0.base_21| 4) |v_#length_36|) (= 0 (select .cse3 |v_thread0Thread1of1ForFork3_~#t2~0.base_17|)) (= (select |v_#valid_104| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) 0) (= 0 |v_thread0Thread1of1ForFork3_~#t1~0.offset_14|) (not (= |v_thread0Thread1of1ForFork3_~#t3~0.base_18| 0)) (= |v_#memory_int_117| (store |v_#memory_int_118| |v_thread0Thread1of1ForFork3_~#t1~0.base_18| (store (select |v_#memory_int_118| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) |v_thread0Thread1of1ForFork3_~#t1~0.offset_14| 0))) (= |v_thread0Thread1of1ForFork3_~#t5~0.offset_17| 0) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t4~0.base_17|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, thread0Thread1of1ForFork3_#in~arg.offset=|v_thread0Thread1of1ForFork3_#in~arg.offset_6|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_118|, #length=|v_#length_38|, thread0Thread1of1ForFork3_#in~arg.base=|v_thread0Thread1of1ForFork3_#in~arg.base_6|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_18|, thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_14|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_13|, thread0Thread1of1ForFork3_#in~arg.offset=|v_thread0Thread1of1ForFork3_#in~arg.offset_6|, thread0Thread1of1ForFork3_#in~arg.base=|v_thread0Thread1of1ForFork3_#in~arg.base_6|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_17|, thread0Thread1of1ForFork3_~arg.base=v_thread0Thread1of1ForFork3_~arg.base_6, #StackHeapBarrier=|v_#StackHeapBarrier_21|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_15|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_18|, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_117|, thread0Thread1of1ForFork3_~arg.offset=v_thread0Thread1of1ForFork3_~arg.offset_6, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_14|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_17|, #length=|v_#length_36|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_21|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_17|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_~#t3~0.base, thread0Thread1of1ForFork3_~#t4~0.offset, thread0Thread1of1ForFork3_~#t2~0.offset, thread0Thread1of1ForFork3_~#t4~0.base, thread0Thread1of1ForFork3_~arg.base, thread0Thread1of1ForFork3_~#t3~0.offset, thread0Thread1of1ForFork3_~#t1~0.base, #valid, #memory_int, thread0Thread1of1ForFork3_~arg.offset, thread0Thread1of1ForFork3_~#t1~0.offset, thread0Thread1of1ForFork3_~#t2~0.base, #length, thread0Thread1of1ForFork3_~#t5~0.base, thread0Thread1of1ForFork3_~#t5~0.offset] because there is no mapped edge [2019-12-27 15:12:43,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [424] [424] L1108-1-->L1109-1: Formula: (= (select (select |v_#memory_int_48| |v_thread0Thread1of1ForFork3_~#t1~0.base_10|) |v_thread0Thread1of1ForFork3_~#t1~0.offset_9|) |v_thread0Thread1of1ForFork3_#t~mem4_27|) InVars {thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_10|, #memory_int=|v_#memory_int_48|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_9|} OutVars{thread0Thread1of1ForFork3_#t~mem4=|v_thread0Thread1of1ForFork3_#t~mem4_27|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_10|, #memory_int=|v_#memory_int_48|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_9|, thread0Thread1of1ForFork3_#t~nondet3=|v_thread0Thread1of1ForFork3_#t~nondet3_4|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_#t~mem4, thread0Thread1of1ForFork3_#t~nondet3] because there is no mapped edge [2019-12-27 15:12:43,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [428] [428] L1123-1-->L1124-1: Formula: (= |v_ULTIMATE.start_main_#t~mem14_31| (select (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t~0.base_14|) |v_ULTIMATE.start_main_~#t~0.offset_14|)) InVars {#memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_14|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_14|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-12-27 15:12:43,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [462] [462] thread1ENTRY-->thread1EXIT: Formula: (and (= 0 |v_thread1Thread1of1ForFork4_#res.base_7|) (= |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| v_~v~0.base_44) (= v_~v~0.offset_44 |v_thread1Thread1of1ForFork4_#t~malloc2.offset_9|) (= v_thread1Thread1of1ForFork4_~arg.offset_7 |v_thread1Thread1of1ForFork4_#in~arg.offset_7|) (not (= |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| 0)) (= |v_#length_34| (store |v_#length_35| |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| 1)) (= 0 (select |v_#valid_99| |v_thread1Thread1of1ForFork4_#t~malloc2.base_9|)) (< |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| |v_#StackHeapBarrier_20|) (= |v_#valid_98| (store |v_#valid_99| |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| 1)) (= 0 |v_thread1Thread1of1ForFork4_#res.offset_7|) (= |v_thread1Thread1of1ForFork4_#t~malloc2.offset_9| 0) (= v_thread1Thread1of1ForFork4_~arg.base_7 |v_thread1Thread1of1ForFork4_#in~arg.base_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_99|, thread1Thread1of1ForFork4_#in~arg.base=|v_thread1Thread1of1ForFork4_#in~arg.base_7|, #length=|v_#length_35|, thread1Thread1of1ForFork4_#in~arg.offset=|v_thread1Thread1of1ForFork4_#in~arg.offset_7|} OutVars{thread1Thread1of1ForFork4_#res.base=|v_thread1Thread1of1ForFork4_#res.base_7|, thread1Thread1of1ForFork4_~arg.offset=v_thread1Thread1of1ForFork4_~arg.offset_7, thread1Thread1of1ForFork4_#t~malloc2.base=|v_thread1Thread1of1ForFork4_#t~malloc2.base_9|, thread1Thread1of1ForFork4_#in~arg.base=|v_thread1Thread1of1ForFork4_#in~arg.base_7|, ~v~0.base=v_~v~0.base_44, #StackHeapBarrier=|v_#StackHeapBarrier_20|, thread1Thread1of1ForFork4_~arg.base=v_thread1Thread1of1ForFork4_~arg.base_7, thread1Thread1of1ForFork4_#res.offset=|v_thread1Thread1of1ForFork4_#res.offset_7|, ~v~0.offset=v_~v~0.offset_44, #valid=|v_#valid_98|, #length=|v_#length_34|, thread1Thread1of1ForFork4_#t~malloc2.offset=|v_thread1Thread1of1ForFork4_#t~malloc2.offset_9|, thread1Thread1of1ForFork4_#in~arg.offset=|v_thread1Thread1of1ForFork4_#in~arg.offset_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_#res.base, thread1Thread1of1ForFork4_~arg.offset, thread1Thread1of1ForFork4_~arg.base, thread1Thread1of1ForFork4_#t~malloc2.base, thread1Thread1of1ForFork4_#res.offset, ~v~0.offset, #valid, #length, thread1Thread1of1ForFork4_#t~malloc2.offset, ~v~0.base] because there is no mapped edge [2019-12-27 15:12:43,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [443] [443] L1097-->thread2EXIT: Formula: (and (= (store |v_#memory_int_81| v_~v~0.base_25 (store (select |v_#memory_int_81| v_~v~0.base_25) v_~v~0.offset_25 88)) |v_#memory_int_80|) (= |v_thread2Thread1of1ForFork5_#res.offset_7| 0) (= 0 |v_thread2Thread1of1ForFork5_#res.base_7|)) InVars {~v~0.offset=v_~v~0.offset_25, #memory_int=|v_#memory_int_81|, ~v~0.base=v_~v~0.base_25} OutVars{~v~0.offset=v_~v~0.offset_25, #memory_int=|v_#memory_int_80|, thread2Thread1of1ForFork5_#res.base=|v_thread2Thread1of1ForFork5_#res.base_7|, thread2Thread1of1ForFork5_#res.offset=|v_thread2Thread1of1ForFork5_#res.offset_7|, ~v~0.base=v_~v~0.base_25} AuxVars[] AssignedVars[#memory_int, thread2Thread1of1ForFork5_#res.base, thread2Thread1of1ForFork5_#res.offset] because there is no mapped edge [2019-12-27 15:12:43,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [412] [412] L1110-2-->L1111-1: Formula: (= (store |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t3~0.base_11| (store (select |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t3~0.base_11|) |v_thread0Thread1of1ForFork3_~#t3~0.offset_9| 2)) |v_#memory_int_36|) InVars {thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_11|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_9|, #memory_int=|v_#memory_int_37|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_11|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_9|, #memory_int=|v_#memory_int_36|, thread0Thread1of1ForFork3_#t~nondet5=|v_thread0Thread1of1ForFork3_#t~nondet5_4|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet5] because there is no mapped edge [2019-12-27 15:12:43,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [417] [417] L1111-2-->L1112-1: Formula: (= (store |v_#memory_int_41| |v_thread0Thread1of1ForFork3_~#t4~0.base_10| (store (select |v_#memory_int_41| |v_thread0Thread1of1ForFork3_~#t4~0.base_10|) |v_thread0Thread1of1ForFork3_~#t4~0.offset_9| 3)) |v_#memory_int_40|) InVars {thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_9|, #memory_int=|v_#memory_int_41|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_10|} OutVars{thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_9|, #memory_int=|v_#memory_int_40|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_10|, thread0Thread1of1ForFork3_#t~nondet6=|v_thread0Thread1of1ForFork3_#t~nondet6_4|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet6] because there is no mapped edge [2019-12-27 15:12:43,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [411] [411] L1112-2-->L1113-1: Formula: (= (store |v_#memory_int_35| |v_thread0Thread1of1ForFork3_~#t5~0.base_10| (store (select |v_#memory_int_35| |v_thread0Thread1of1ForFork3_~#t5~0.base_10|) |v_thread0Thread1of1ForFork3_~#t5~0.offset_8| 4)) |v_#memory_int_34|) InVars {#memory_int=|v_#memory_int_35|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_10|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_8|} OutVars{#memory_int=|v_#memory_int_34|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_10|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_8|, thread0Thread1of1ForFork3_#t~nondet7=|v_thread0Thread1of1ForFork3_#t~nondet7_4|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet7] because there is no mapped edge [2019-12-27 15:12:43,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [435] [435] L1113-2-->L1114-1: Formula: (= (select (select |v_#memory_int_62| |v_thread0Thread1of1ForFork3_~#t2~0.base_10|) |v_thread0Thread1of1ForFork3_~#t2~0.offset_8|) |v_thread0Thread1of1ForFork3_#t~mem9_27|) InVars {thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_8|, #memory_int=|v_#memory_int_62|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_10|} OutVars{thread0Thread1of1ForFork3_#t~nondet8=|v_thread0Thread1of1ForFork3_#t~nondet8_4|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_8|, #memory_int=|v_#memory_int_62|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_10|, thread0Thread1of1ForFork3_#t~mem9=|v_thread0Thread1of1ForFork3_#t~mem9_27|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_#t~nondet8, thread0Thread1of1ForFork3_#t~mem9] because there is no mapped edge [2019-12-27 15:12:43,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [449] [449] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.base_11| 0) (= 0 |v_thread2Thread1of1ForFork2_#res.offset_11|) (= (store |v_#memory_int_109| v_~v~0.base_37 (store (select |v_#memory_int_109| v_~v~0.base_37) v_~v~0.offset_37 88)) |v_#memory_int_108|)) InVars {~v~0.offset=v_~v~0.offset_37, #memory_int=|v_#memory_int_109|, ~v~0.base=v_~v~0.base_37} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_11|, ~v~0.offset=v_~v~0.offset_37, #memory_int=|v_#memory_int_108|, ~v~0.base=v_~v~0.base_37, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, #memory_int, thread2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 15:12:43,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [446] [446] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_13| 0) (= |v_thread2Thread1of1ForFork1_#res.base_13| 0) (= (store |v_#memory_int_89| v_~v~0.base_28 (store (select |v_#memory_int_89| v_~v~0.base_28) v_~v~0.offset_28 88)) |v_#memory_int_88|)) InVars {~v~0.offset=v_~v~0.offset_28, #memory_int=|v_#memory_int_89|, ~v~0.base=v_~v~0.base_28} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_13|, ~v~0.offset=v_~v~0.offset_28, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_13|, #memory_int=|v_#memory_int_88|, ~v~0.base=v_~v~0.base_28} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, #memory_int] because there is no mapped edge [2019-12-27 15:12:43,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [448] [448] L1102-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_7| 0) (= |v_#memory_int_96| (store |v_#memory_int_97| v_~v~0.base_32 (store (select |v_#memory_int_97| v_~v~0.base_32) v_~v~0.offset_32 89))) (= |v_thread3Thread1of1ForFork0_#res.base_7| 0)) InVars {~v~0.offset=v_~v~0.offset_32, #memory_int=|v_#memory_int_97|, ~v~0.base=v_~v~0.base_32} OutVars{~v~0.offset=v_~v~0.offset_32, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_7|, #memory_int=|v_#memory_int_96|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_7|, ~v~0.base=v_~v~0.base_32} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 15:12:43,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [470] [470] L1118-->thread0EXIT: Formula: (and (= (store (store (store (store (store |v_#valid_121| |v_thread0Thread1of1ForFork3_~#t1~0.base_22| 0) |v_thread0Thread1of1ForFork3_~#t2~0.base_21| 0) |v_thread0Thread1of1ForFork3_~#t3~0.base_22| 0) |v_thread0Thread1of1ForFork3_~#t4~0.base_21| 0) |v_thread0Thread1of1ForFork3_~#t5~0.base_25| 0) |v_#valid_120|) (= 0 |v_thread0Thread1of1ForFork3_#res.offset_4|) (= 0 |v_thread0Thread1of1ForFork3_#res.base_4|)) InVars {thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_22|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_22|, #valid=|v_#valid_121|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_21|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_25|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_21|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_21|, thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_16|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_15|, thread0Thread1of1ForFork3_#res.base=|v_thread0Thread1of1ForFork3_#res.base_4|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_20|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_17|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_21|, thread0Thread1of1ForFork3_#res.offset=|v_thread0Thread1of1ForFork3_#res.offset_4|, #valid=|v_#valid_120|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_20|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_16|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_24|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_19|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_~#t3~0.base, thread0Thread1of1ForFork3_~#t4~0.offset, thread0Thread1of1ForFork3_~#t2~0.offset, thread0Thread1of1ForFork3_#res.base, thread0Thread1of1ForFork3_~#t4~0.base, thread0Thread1of1ForFork3_~#t3~0.offset, thread0Thread1of1ForFork3_~#t1~0.base, thread0Thread1of1ForFork3_#res.offset, #valid, thread0Thread1of1ForFork3_~#t2~0.base, thread0Thread1of1ForFork3_~#t1~0.offset, thread0Thread1of1ForFork3_~#t5~0.base, thread0Thread1of1ForFork3_~#t5~0.offset] because there is no mapped edge [2019-12-27 15:12:43,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [457] [457] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_21| (select (select |v_#memory_int_115| v_~v~0.base_42) v_~v~0.offset_42)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (not (= |v_ULTIMATE.start_main_#t~mem15_21| 88)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_115|, ~v~0.base=v_~v~0.base_42} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_21|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:12:44,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:12:44 BasicIcfg [2019-12-27 15:12:44,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:12:44,072 INFO L168 Benchmark]: Toolchain (without parser) took 41207.94 ms. Allocated memory was 138.4 MB in the beginning and 836.2 MB in the end (delta: 697.8 MB). Free memory was 100.2 MB in the beginning and 123.1 MB in the end (delta: -22.9 MB). Peak memory consumption was 674.9 MB. Max. memory is 7.1 GB. [2019-12-27 15:12:44,076 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 15:12:44,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1025.59 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 122.1 MB in the end (delta: -22.3 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:12:44,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.83 ms. Allocated memory is still 202.9 MB. Free memory was 122.1 MB in the beginning and 119.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:12:44,077 INFO L168 Benchmark]: Boogie Preprocessor took 36.73 ms. Allocated memory is still 202.9 MB. Free memory was 119.4 MB in the beginning and 118.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 15:12:44,077 INFO L168 Benchmark]: RCFGBuilder took 492.89 ms. Allocated memory is still 202.9 MB. Free memory was 118.1 MB in the beginning and 91.9 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 15:12:44,078 INFO L168 Benchmark]: TraceAbstraction took 39579.74 ms. Allocated memory was 202.9 MB in the beginning and 836.2 MB in the end (delta: 633.3 MB). Free memory was 91.2 MB in the beginning and 123.1 MB in the end (delta: -31.9 MB). Peak memory consumption was 601.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:12:44,080 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1025.59 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 122.1 MB in the end (delta: -22.3 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.83 ms. Allocated memory is still 202.9 MB. Free memory was 122.1 MB in the beginning and 119.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.73 ms. Allocated memory is still 202.9 MB. Free memory was 119.4 MB in the beginning and 118.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 492.89 ms. Allocated memory is still 202.9 MB. Free memory was 118.1 MB in the beginning and 91.9 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39579.74 ms. Allocated memory was 202.9 MB in the beginning and 836.2 MB in the end (delta: 633.3 MB). Free memory was 91.2 MB in the beginning and 123.1 MB in the end (delta: -31.9 MB). Peak memory consumption was 601.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.5s, 172 ProgramPointsBefore, 99 ProgramPointsAfterwards, 243 TransitionsBefore, 173 TransitionsAfterwards, 4038 CoEnabledTransitionPairs, 6 FixpointIterations, 23 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 1461 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 10 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2242 CheckedPairsTotal, 74 TotalNumberOfCompositions - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6:0}, v={0: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={9:0}, t2={11:0}, t3={10:0}, t4={8: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={9:0}, t2={11:0}, t3={10:0}, t4={8: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={9:0}, t2={11:0}, t3={10:0}, t4={8: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}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={11:0}, t3={10:0}, t4={8: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={9:0}, t2={11:0}, t3={10:0}, t4={8: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}, 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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6:0}, v={1:0}] [L1115] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={11:0}, t3={10:0}, t4={8: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={9:0}, t2={11:0}, t3={10:0}, t4={8: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={9:0}, t2={11:0}, t3={10:0}, t4={8: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={9:0}, t2={11:0}, t3={10:0}, t4={8: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={9:0}, t2={11:0}, t3={10:0}, t4={8: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 error locations. Result: UNSAFE, OverallTime: 39.0s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4334 SDtfs, 7709 SDslu, 15024 SDs, 0 SdLazy, 9369 SolverSat, 1173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 716 GetRequests, 151 SyntacticMatches, 19 SemanticMatches, 546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4305occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 41 MinimizatonAttempts, 33391 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 867 ConstructedInterpolants, 0 QuantifiedInterpolants, 331377 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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...