/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:20:59,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:20:59,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:20:59,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:20:59,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:20:59,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:20:59,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:20:59,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:20:59,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:20:59,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:20:59,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:20:59,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:20:59,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:20:59,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:20:59,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:20:59,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:20:59,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:20:59,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:20:59,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:20:59,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:20:59,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:20:59,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:20:59,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:20:59,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:20:59,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:20:59,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:20:59,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:20:59,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:20:59,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:20:59,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:20:59,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:20:59,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:20:59,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:20:59,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:20:59,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:20:59,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:20:59,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:20:59,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:20:59,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:20:59,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:20:59,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:20:59,715 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-VariableLbe-MCR.epf [2019-12-27 19:20:59,742 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:20:59,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:20:59,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:20:59,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:20:59,744 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:20:59,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:20:59,744 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:20:59,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:20:59,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:20:59,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:20:59,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:20:59,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:20:59,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:20:59,745 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:20:59,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:20:59,746 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:20:59,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:20:59,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:20:59,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:20:59,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:20:59,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:20:59,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:20:59,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:20:59,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:20:59,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:20:59,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:20:59,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:20:59,748 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:20:59,748 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:20:59,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:20:59,749 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:20:59,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:21:00,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:21:00,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:21:00,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:21:00,046 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:21:00,047 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:21:00,047 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 19:21:00,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16986a7e2/029110373b5442cc97f4bdbd9726e83d/FLAG87bc5880f [2019-12-27 19:21:00,766 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:21:00,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2019-12-27 19:21:00,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16986a7e2/029110373b5442cc97f4bdbd9726e83d/FLAG87bc5880f [2019-12-27 19:21:00,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16986a7e2/029110373b5442cc97f4bdbd9726e83d [2019-12-27 19:21:00,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:21:00,961 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:21:00,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:21:00,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:21:00,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:21:00,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:21:00" (1/1) ... [2019-12-27 19:21:00,970 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 07:21:00, skipping insertion in model container [2019-12-27 19:21:00,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:21:00" (1/1) ... [2019-12-27 19:21:00,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:21:01,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:21:01,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:21:01,672 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:21:01,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:21:01,915 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:21:01,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:01 WrapperNode [2019-12-27 19:21:01,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:21:01,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:21:01,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:21:01,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:21:01,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:01" (1/1) ... [2019-12-27 19:21:01,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:01" (1/1) ... [2019-12-27 19:21:01,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:21:01,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:21:01,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:21:01,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:21:01,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:01" (1/1) ... [2019-12-27 19:21:01,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:01" (1/1) ... [2019-12-27 19:21:01,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:01" (1/1) ... [2019-12-27 19:21:01,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:01" (1/1) ... [2019-12-27 19:21:02,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:01" (1/1) ... [2019-12-27 19:21:02,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:01" (1/1) ... [2019-12-27 19:21:02,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:01" (1/1) ... [2019-12-27 19:21:02,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:21:02,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:21:02,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:21:02,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:21:02,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:01" (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 19:21:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:21:02,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:21:02,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 19:21:02,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2019-12-27 19:21:02,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2019-12-27 19:21:02,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-12-27 19:21:02,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-12-27 19:21:02,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-12-27 19:21:02,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-12-27 19:21:02,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-12-27 19:21:02,089 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-12-27 19:21:02,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:21:02,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-27 19:21:02,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:21:02,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:21:02,091 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 19:21:02,541 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:21:02,541 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 19:21:02,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:21:02 BoogieIcfgContainer [2019-12-27 19:21:02,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:21:02,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:21:02,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:21:02,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:21:02,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:21:00" (1/3) ... [2019-12-27 19:21:02,548 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 07:21:02, skipping insertion in model container [2019-12-27 19:21:02,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:01" (2/3) ... [2019-12-27 19:21:02,549 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 07:21:02, skipping insertion in model container [2019-12-27 19:21:02,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:21:02" (3/3) ... [2019-12-27 19:21:02,551 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2019-12-27 19:21:02,561 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:21:02,561 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:21:02,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 19:21:02,570 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:21:02,624 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,624 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,624 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,625 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,625 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,625 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,626 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,626 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,626 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,626 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,627 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,627 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,627 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,627 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,628 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,628 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,628 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,629 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,629 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,629 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,630 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,630 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,630 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,631 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,631 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,631 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,631 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,632 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,632 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,632 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,632 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,632 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,633 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,633 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,633 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,633 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,634 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,634 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,634 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,634 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,635 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,635 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,635 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,635 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,635 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,636 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,636 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,636 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,636 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,637 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,637 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,637 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,637 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,638 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,638 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,638 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,638 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,638 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,639 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,639 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,639 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,639 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,639 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,640 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,640 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,640 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,641 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,641 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,641 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,641 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,641 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,641 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,642 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,642 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,642 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,642 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,643 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,643 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,643 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,643 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,644 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,644 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,644 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,644 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,644 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,645 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,645 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,645 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,645 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,646 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,646 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,646 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,646 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,646 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,647 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,647 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,647 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,647 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,648 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,648 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,651 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,652 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,652 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,652 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,657 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,658 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,658 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,658 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,661 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,662 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,662 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,662 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,665 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,666 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,666 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,666 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,666 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,666 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,667 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,667 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,667 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,667 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,667 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,667 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,668 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,668 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,668 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,668 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,668 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,669 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,669 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,669 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,669 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,669 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,670 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,670 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,672 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,673 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,673 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,673 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,673 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,673 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,677 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,678 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,678 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,678 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,680 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,681 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,681 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,681 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,681 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,681 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,683 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,683 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,683 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,684 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,686 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,686 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,687 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,687 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,689 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,689 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,689 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,689 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,691 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,692 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,692 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,692 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:02,852 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-27 19:21:02,872 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:21:02,872 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:21:02,872 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:21:02,873 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:21:02,873 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:21:02,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:21:02,873 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:21:02,873 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:21:02,901 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions [2019-12-27 19:21:02,903 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-12-27 19:21:03,087 INFO L132 PetriNetUnfolder]: 61/264 cut-off events. [2019-12-27 19:21:03,087 INFO L133 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2019-12-27 19:21:03,109 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 19:21:03,130 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-12-27 19:21:03,227 INFO L132 PetriNetUnfolder]: 61/264 cut-off events. [2019-12-27 19:21:03,227 INFO L133 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2019-12-27 19:21:03,233 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 19:21:03,245 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4038 [2019-12-27 19:21:03,246 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:21:04,978 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 19:21:05,121 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-27 19:21:05,279 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-27 19:21:05,446 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2242 [2019-12-27 19:21:05,446 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2019-12-27 19:21:05,450 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 173 transitions [2019-12-27 19:21:06,035 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2019-12-27 19:21:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2019-12-27 19:21:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:21:06,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:06,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:06,047 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 19:21:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1385407457, now seen corresponding path program 1 times [2019-12-27 19:21:06,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:06,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335630614] [2019-12-27 19:21:06,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:06,399 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 19:21:06,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335630614] [2019-12-27 19:21:06,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:06,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:21:06,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [229525419] [2019-12-27 19:21:06,405 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:06,411 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:06,432 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 13 transitions. [2019-12-27 19:21:06,432 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:06,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:06,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:21:06,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:06,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:21:06,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:21:06,466 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 7 states. [2019-12-27 19:21:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:06,932 INFO L93 Difference]: Finished difference Result 4746 states and 19878 transitions. [2019-12-27 19:21:06,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:21:06,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-27 19:21:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:07,019 INFO L225 Difference]: With dead ends: 4746 [2019-12-27 19:21:07,020 INFO L226 Difference]: Without dead ends: 4260 [2019-12-27 19:21:07,022 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 19:21:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2019-12-27 19:21:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 3008. [2019-12-27 19:21:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2019-12-27 19:21:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2019-12-27 19:21:07,354 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2019-12-27 19:21:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:07,355 INFO L462 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2019-12-27 19:21:07,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:21:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2019-12-27 19:21:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:21:07,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:07,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:07,357 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 19:21:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:07,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1538202320, now seen corresponding path program 1 times [2019-12-27 19:21:07,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:07,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441717449] [2019-12-27 19:21:07,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:07,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 19:21:07,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441717449] [2019-12-27 19:21:07,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:07,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:21:07,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1156892286] [2019-12-27 19:21:07,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:07,534 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:07,539 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 19:21:07,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:07,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:21:07,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:21:07,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:07,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:21:07,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:21:07,542 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2019-12-27 19:21:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:07,655 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2019-12-27 19:21:07,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:21:07,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 19:21:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:07,685 INFO L225 Difference]: With dead ends: 4848 [2019-12-27 19:21:07,685 INFO L226 Difference]: Without dead ends: 3558 [2019-12-27 19:21:07,686 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 19:21:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2019-12-27 19:21:07,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2019-12-27 19:21:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-12-27 19:21:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2019-12-27 19:21:07,850 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2019-12-27 19:21:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:07,850 INFO L462 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2019-12-27 19:21:07,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:21:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2019-12-27 19:21:07,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:21:07,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:07,852 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 19:21:07,853 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 19:21:07,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:07,853 INFO L82 PathProgramCache]: Analyzing trace with hash 439630726, now seen corresponding path program 1 times [2019-12-27 19:21:07,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:07,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242344459] [2019-12-27 19:21:07,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:07,980 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 19:21:07,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242344459] [2019-12-27 19:21:07,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:07,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:21:07,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [837927910] [2019-12-27 19:21:07,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:07,987 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:07,992 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 36 transitions. [2019-12-27 19:21:07,993 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:07,995 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:07,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:21:07,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:07,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:21:07,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:21:07,997 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 7 states. [2019-12-27 19:21:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:08,347 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2019-12-27 19:21:08,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:08,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-27 19:21:08,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:08,392 INFO L225 Difference]: With dead ends: 4417 [2019-12-27 19:21:08,392 INFO L226 Difference]: Without dead ends: 4393 [2019-12-27 19:21:08,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:21:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2019-12-27 19:21:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2019-12-27 19:21:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-12-27 19:21:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2019-12-27 19:21:08,695 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2019-12-27 19:21:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:08,695 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2019-12-27 19:21:08,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:21:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2019-12-27 19:21:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:21:08,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:08,697 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 19:21:08,698 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 19:21:08,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1784829996, now seen corresponding path program 2 times [2019-12-27 19:21:08,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:08,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498150715] [2019-12-27 19:21:08,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:08,787 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 19:21:08,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498150715] [2019-12-27 19:21:08,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:08,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:21:08,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [48905046] [2019-12-27 19:21:08,789 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:08,791 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:08,795 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 23 transitions. [2019-12-27 19:21:08,795 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:08,807 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:21:08,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:21:08,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:08,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:21:08,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:21:08,808 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 7 states. [2019-12-27 19:21:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:09,009 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2019-12-27 19:21:09,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:21:09,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-27 19:21:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:09,034 INFO L225 Difference]: With dead ends: 4024 [2019-12-27 19:21:09,034 INFO L226 Difference]: Without dead ends: 4024 [2019-12-27 19:21:09,036 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 19:21:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2019-12-27 19:21:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2019-12-27 19:21:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2019-12-27 19:21:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2019-12-27 19:21:09,198 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2019-12-27 19:21:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:09,198 INFO L462 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2019-12-27 19:21:09,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:21:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2019-12-27 19:21:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:21:09,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:09,204 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 19:21:09,204 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 19:21:09,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:09,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2096337026, now seen corresponding path program 1 times [2019-12-27 19:21:09,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:09,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310876747] [2019-12-27 19:21:09,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:09,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310876747] [2019-12-27 19:21:09,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:09,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:21:09,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1853075487] [2019-12-27 19:21:09,318 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:09,320 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:09,324 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 33 transitions. [2019-12-27 19:21:09,325 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:09,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:09,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:21:09,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:09,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:21:09,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:21:09,329 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 7 states. [2019-12-27 19:21:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:09,607 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2019-12-27 19:21:09,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:09,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 19:21:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:09,627 INFO L225 Difference]: With dead ends: 4225 [2019-12-27 19:21:09,627 INFO L226 Difference]: Without dead ends: 4129 [2019-12-27 19:21:09,628 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 19:21:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2019-12-27 19:21:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2019-12-27 19:21:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2019-12-27 19:21:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2019-12-27 19:21:10,240 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2019-12-27 19:21:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:10,241 INFO L462 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2019-12-27 19:21:10,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:21:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2019-12-27 19:21:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:21:10,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:10,243 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 19:21:10,243 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 19:21:10,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:10,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1440753652, now seen corresponding path program 2 times [2019-12-27 19:21:10,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:10,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386870315] [2019-12-27 19:21:10,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:10,337 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 19:21:10,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386870315] [2019-12-27 19:21:10,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:10,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:21:10,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1848761812] [2019-12-27 19:21:10,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:10,342 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:10,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 22 transitions. [2019-12-27 19:21:10,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:10,348 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:10,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:21:10,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:10,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:21:10,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:21:10,349 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2019-12-27 19:21:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:10,738 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2019-12-27 19:21:10,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:10,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-27 19:21:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:10,765 INFO L225 Difference]: With dead ends: 4979 [2019-12-27 19:21:10,766 INFO L226 Difference]: Without dead ends: 4905 [2019-12-27 19:21:10,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:21:10,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-12-27 19:21:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2019-12-27 19:21:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2019-12-27 19:21:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2019-12-27 19:21:10,931 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2019-12-27 19:21:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:10,932 INFO L462 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2019-12-27 19:21:10,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:21:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2019-12-27 19:21:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:21:10,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:10,934 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 19:21:10,934 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 19:21:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2054209068, now seen corresponding path program 3 times [2019-12-27 19:21:10,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:10,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606966458] [2019-12-27 19:21:10,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:11,063 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 19:21:11,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606966458] [2019-12-27 19:21:11,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:11,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:21:11,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66148010] [2019-12-27 19:21:11,065 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:11,068 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:11,072 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 19:21:11,072 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:11,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:11,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:21:11,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:11,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:21:11,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:21:11,085 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 10 states. [2019-12-27 19:21:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:11,652 INFO L93 Difference]: Finished difference Result 5390 states and 21925 transitions. [2019-12-27 19:21:11,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 19:21:11,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-27 19:21:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:11,674 INFO L225 Difference]: With dead ends: 5390 [2019-12-27 19:21:11,674 INFO L226 Difference]: Without dead ends: 5316 [2019-12-27 19:21:11,675 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 19:21:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2019-12-27 19:21:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4125. [2019-12-27 19:21:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2019-12-27 19:21:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 16604 transitions. [2019-12-27 19:21:11,822 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 16604 transitions. Word has length 18 [2019-12-27 19:21:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:11,823 INFO L462 AbstractCegarLoop]: Abstraction has 4125 states and 16604 transitions. [2019-12-27 19:21:11,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:21:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 16604 transitions. [2019-12-27 19:21:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:21:11,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:11,825 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 19:21:11,825 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 19:21:11,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:11,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1150446370, now seen corresponding path program 4 times [2019-12-27 19:21:11,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:11,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052727324] [2019-12-27 19:21:11,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:12,059 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 19:21:12,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052727324] [2019-12-27 19:21:12,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:12,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:21:12,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [560233017] [2019-12-27 19:21:12,060 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:12,062 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:12,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 20 transitions. [2019-12-27 19:21:12,066 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:12,067 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:12,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:21:12,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:12,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:21:12,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:21:12,068 INFO L87 Difference]: Start difference. First operand 4125 states and 16604 transitions. Second operand 10 states. [2019-12-27 19:21:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:12,568 INFO L93 Difference]: Finished difference Result 5676 states and 23387 transitions. [2019-12-27 19:21:12,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:21:12,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-27 19:21:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:12,593 INFO L225 Difference]: With dead ends: 5676 [2019-12-27 19:21:12,593 INFO L226 Difference]: Without dead ends: 5620 [2019-12-27 19:21:12,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:21:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5620 states. [2019-12-27 19:21:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5620 to 4114. [2019-12-27 19:21:12,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2019-12-27 19:21:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 16572 transitions. [2019-12-27 19:21:12,751 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 16572 transitions. Word has length 18 [2019-12-27 19:21:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:12,753 INFO L462 AbstractCegarLoop]: Abstraction has 4114 states and 16572 transitions. [2019-12-27 19:21:12,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:21:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 16572 transitions. [2019-12-27 19:21:12,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:21:12,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:12,755 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 19:21:12,755 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 19:21:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1529508729, now seen corresponding path program 1 times [2019-12-27 19:21:12,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:12,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925103760] [2019-12-27 19:21:12,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:12,868 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 19:21:12,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925103760] [2019-12-27 19:21:12,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:12,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:21:12,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261652440] [2019-12-27 19:21:12,869 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:12,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:12,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 33 transitions. [2019-12-27 19:21:12,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:12,912 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:21:12,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:21:12,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:12,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:21:12,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:21:12,914 INFO L87 Difference]: Start difference. First operand 4114 states and 16572 transitions. Second operand 9 states. [2019-12-27 19:21:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:13,159 INFO L93 Difference]: Finished difference Result 4623 states and 18113 transitions. [2019-12-27 19:21:13,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:21:13,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 19:21:13,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:13,181 INFO L225 Difference]: With dead ends: 4623 [2019-12-27 19:21:13,182 INFO L226 Difference]: Without dead ends: 4623 [2019-12-27 19:21:13,182 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 19:21:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2019-12-27 19:21:13,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4076. [2019-12-27 19:21:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-12-27 19:21:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 16430 transitions. [2019-12-27 19:21:13,337 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 16430 transitions. Word has length 19 [2019-12-27 19:21:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:13,338 INFO L462 AbstractCegarLoop]: Abstraction has 4076 states and 16430 transitions. [2019-12-27 19:21:13,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:21:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 16430 transitions. [2019-12-27 19:21:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:21:13,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:13,341 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 19:21:13,341 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 19:21:13,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:13,341 INFO L82 PathProgramCache]: Analyzing trace with hash 386755117, now seen corresponding path program 1 times [2019-12-27 19:21:13,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:13,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295276061] [2019-12-27 19:21:13,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:13,593 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 19:21:13,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295276061] [2019-12-27 19:21:13,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:13,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:21:13,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [32013141] [2019-12-27 19:21:13,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:13,597 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:13,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 23 transitions. [2019-12-27 19:21:13,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:13,602 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:13,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:21:13,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:13,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:21:13,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:21:13,603 INFO L87 Difference]: Start difference. First operand 4076 states and 16430 transitions. Second operand 11 states. [2019-12-27 19:21:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:14,239 INFO L93 Difference]: Finished difference Result 5825 states and 24230 transitions. [2019-12-27 19:21:14,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:14,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 19:21:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:14,257 INFO L225 Difference]: With dead ends: 5825 [2019-12-27 19:21:14,258 INFO L226 Difference]: Without dead ends: 5751 [2019-12-27 19:21:14,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:21:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2019-12-27 19:21:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 4013. [2019-12-27 19:21:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2019-12-27 19:21:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16198 transitions. [2019-12-27 19:21:14,408 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16198 transitions. Word has length 19 [2019-12-27 19:21:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:14,409 INFO L462 AbstractCegarLoop]: Abstraction has 4013 states and 16198 transitions. [2019-12-27 19:21:14,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:21:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16198 transitions. [2019-12-27 19:21:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:21:14,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:14,411 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 19:21:14,412 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 19:21:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:14,412 INFO L82 PathProgramCache]: Analyzing trace with hash 169969073, now seen corresponding path program 1 times [2019-12-27 19:21:14,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:14,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979063504] [2019-12-27 19:21:14,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:14,594 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 19:21:14,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979063504] [2019-12-27 19:21:14,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:14,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:21:14,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1511372905] [2019-12-27 19:21:14,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:14,597 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:14,602 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 38 transitions. [2019-12-27 19:21:14,602 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:14,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:14,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:21:14,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:14,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:21:14,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:21:14,605 INFO L87 Difference]: Start difference. First operand 4013 states and 16198 transitions. Second operand 10 states. [2019-12-27 19:21:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:15,201 INFO L93 Difference]: Finished difference Result 5428 states and 21853 transitions. [2019-12-27 19:21:15,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:21:15,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-27 19:21:15,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:15,214 INFO L225 Difference]: With dead ends: 5428 [2019-12-27 19:21:15,214 INFO L226 Difference]: Without dead ends: 5382 [2019-12-27 19:21:15,215 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 19:21:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2019-12-27 19:21:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 4166. [2019-12-27 19:21:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2019-12-27 19:21:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 16924 transitions. [2019-12-27 19:21:15,345 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 16924 transitions. Word has length 20 [2019-12-27 19:21:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:15,345 INFO L462 AbstractCegarLoop]: Abstraction has 4166 states and 16924 transitions. [2019-12-27 19:21:15,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:21:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 16924 transitions. [2019-12-27 19:21:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:21:15,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:15,348 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 19:21:15,348 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 19:21:15,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:15,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1932078158, now seen corresponding path program 1 times [2019-12-27 19:21:15,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:15,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752531503] [2019-12-27 19:21:15,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:15,538 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 19:21:15,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752531503] [2019-12-27 19:21:15,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:15,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:21:15,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1460886984] [2019-12-27 19:21:15,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:15,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:15,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 22 transitions. [2019-12-27 19:21:15,544 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:15,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:15,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:21:15,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:15,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:21:15,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:21:15,545 INFO L87 Difference]: Start difference. First operand 4166 states and 16924 transitions. Second operand 10 states. [2019-12-27 19:21:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:16,078 INFO L93 Difference]: Finished difference Result 5500 states and 22434 transitions. [2019-12-27 19:21:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:16,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-27 19:21:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:16,091 INFO L225 Difference]: With dead ends: 5500 [2019-12-27 19:21:16,091 INFO L226 Difference]: Without dead ends: 5454 [2019-12-27 19:21:16,091 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 19:21:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5454 states. [2019-12-27 19:21:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5454 to 4012. [2019-12-27 19:21:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4012 states. [2019-12-27 19:21:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 16195 transitions. [2019-12-27 19:21:16,203 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 16195 transitions. Word has length 20 [2019-12-27 19:21:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:16,204 INFO L462 AbstractCegarLoop]: Abstraction has 4012 states and 16195 transitions. [2019-12-27 19:21:16,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:21:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 16195 transitions. [2019-12-27 19:21:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:21:16,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:16,206 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 19:21:16,207 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 19:21:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:16,207 INFO L82 PathProgramCache]: Analyzing trace with hash -944906415, now seen corresponding path program 2 times [2019-12-27 19:21:16,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:16,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920219534] [2019-12-27 19:21:16,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:16,421 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 19:21:16,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920219534] [2019-12-27 19:21:16,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:16,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:21:16,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273435833] [2019-12-27 19:21:16,422 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:16,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:16,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 38 transitions. [2019-12-27 19:21:16,429 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:16,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:16,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:21:16,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:16,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:21:16,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:21:16,430 INFO L87 Difference]: Start difference. First operand 4012 states and 16195 transitions. Second operand 10 states. [2019-12-27 19:21:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:17,107 INFO L93 Difference]: Finished difference Result 5781 states and 23394 transitions. [2019-12-27 19:21:17,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:17,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-27 19:21:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:17,121 INFO L225 Difference]: With dead ends: 5781 [2019-12-27 19:21:17,121 INFO L226 Difference]: Without dead ends: 5735 [2019-12-27 19:21:17,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:21:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2019-12-27 19:21:17,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 4148. [2019-12-27 19:21:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4148 states. [2019-12-27 19:21:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 16836 transitions. [2019-12-27 19:21:17,243 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 16836 transitions. Word has length 20 [2019-12-27 19:21:17,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:17,244 INFO L462 AbstractCegarLoop]: Abstraction has 4148 states and 16836 transitions. [2019-12-27 19:21:17,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:21:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 16836 transitions. [2019-12-27 19:21:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:21:17,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:17,247 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 19:21:17,247 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 19:21:17,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:17,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1562884562, now seen corresponding path program 2 times [2019-12-27 19:21:17,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:17,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354207299] [2019-12-27 19:21:17,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:17,456 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 19:21:17,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354207299] [2019-12-27 19:21:17,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:17,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:21:17,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [482732105] [2019-12-27 19:21:17,457 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:17,461 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:17,466 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 26 transitions. [2019-12-27 19:21:17,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:17,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:17,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:21:17,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:17,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:21:17,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:21:17,493 INFO L87 Difference]: Start difference. First operand 4148 states and 16836 transitions. Second operand 11 states. [2019-12-27 19:21:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:18,132 INFO L93 Difference]: Finished difference Result 5447 states and 22263 transitions. [2019-12-27 19:21:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:21:18,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-12-27 19:21:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:18,147 INFO L225 Difference]: With dead ends: 5447 [2019-12-27 19:21:18,147 INFO L226 Difference]: Without dead ends: 5401 [2019-12-27 19:21:18,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:21:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2019-12-27 19:21:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 3978. [2019-12-27 19:21:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2019-12-27 19:21:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 16074 transitions. [2019-12-27 19:21:18,255 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 16074 transitions. Word has length 20 [2019-12-27 19:21:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:18,255 INFO L462 AbstractCegarLoop]: Abstraction has 3978 states and 16074 transitions. [2019-12-27 19:21:18,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:21:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 16074 transitions. [2019-12-27 19:21:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:21:18,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:18,259 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 19:21:18,259 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 19:21:18,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:18,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1961766501, now seen corresponding path program 3 times [2019-12-27 19:21:18,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:18,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756446355] [2019-12-27 19:21:18,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:18,352 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 19:21:18,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756446355] [2019-12-27 19:21:18,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:18,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:21:18,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1096737126] [2019-12-27 19:21:18,354 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:18,358 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:18,364 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 42 transitions. [2019-12-27 19:21:18,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:18,379 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:18,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:21:18,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:18,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:21:18,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:21:18,381 INFO L87 Difference]: Start difference. First operand 3978 states and 16074 transitions. Second operand 9 states. [2019-12-27 19:21:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:18,775 INFO L93 Difference]: Finished difference Result 5367 states and 21678 transitions. [2019-12-27 19:21:18,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:21:18,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-12-27 19:21:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:18,787 INFO L225 Difference]: With dead ends: 5367 [2019-12-27 19:21:18,787 INFO L226 Difference]: Without dead ends: 5321 [2019-12-27 19:21:18,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:21:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5321 states. [2019-12-27 19:21:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5321 to 3948. [2019-12-27 19:21:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-27 19:21:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 16005 transitions. [2019-12-27 19:21:18,872 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 16005 transitions. Word has length 20 [2019-12-27 19:21:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:18,872 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 16005 transitions. [2019-12-27 19:21:18,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:21:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 16005 transitions. [2019-12-27 19:21:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:21:18,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:18,875 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 19:21:18,875 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 19:21:18,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:18,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2117723117, now seen corresponding path program 1 times [2019-12-27 19:21:18,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:18,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679585737] [2019-12-27 19:21:18,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:18,929 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 19:21:18,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679585737] [2019-12-27 19:21:18,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:18,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:21:18,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [842290988] [2019-12-27 19:21:18,930 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:18,932 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:18,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 40 transitions. [2019-12-27 19:21:18,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:18,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:18,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:21:18,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:18,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:21:18,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:21:18,939 INFO L87 Difference]: Start difference. First operand 3948 states and 16005 transitions. Second operand 7 states. [2019-12-27 19:21:19,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:19,109 INFO L93 Difference]: Finished difference Result 4727 states and 18672 transitions. [2019-12-27 19:21:19,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:19,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-27 19:21:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:19,123 INFO L225 Difference]: With dead ends: 4727 [2019-12-27 19:21:19,123 INFO L226 Difference]: Without dead ends: 4652 [2019-12-27 19:21:19,124 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 19:21:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2019-12-27 19:21:19,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 4270. [2019-12-27 19:21:19,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2019-12-27 19:21:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 17192 transitions. [2019-12-27 19:21:19,227 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 17192 transitions. Word has length 21 [2019-12-27 19:21:19,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:19,228 INFO L462 AbstractCegarLoop]: Abstraction has 4270 states and 17192 transitions. [2019-12-27 19:21:19,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:21:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 17192 transitions. [2019-12-27 19:21:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:21:19,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:19,232 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 19:21:19,232 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 19:21:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1335103446, now seen corresponding path program 1 times [2019-12-27 19:21:19,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:19,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900063611] [2019-12-27 19:21:19,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:19,359 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 19:21:19,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900063611] [2019-12-27 19:21:19,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:19,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:21:19,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [547455658] [2019-12-27 19:21:19,361 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:19,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:19,370 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 23 transitions. [2019-12-27 19:21:19,371 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:19,372 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:19,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:21:19,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:19,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:21:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:21:19,375 INFO L87 Difference]: Start difference. First operand 4270 states and 17192 transitions. Second operand 8 states. [2019-12-27 19:21:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:19,559 INFO L93 Difference]: Finished difference Result 4820 states and 18862 transitions. [2019-12-27 19:21:19,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:21:19,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-27 19:21:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:19,575 INFO L225 Difference]: With dead ends: 4820 [2019-12-27 19:21:19,575 INFO L226 Difference]: Without dead ends: 4296 [2019-12-27 19:21:19,575 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 19:21:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2019-12-27 19:21:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3680. [2019-12-27 19:21:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2019-12-27 19:21:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 14531 transitions. [2019-12-27 19:21:19,696 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 14531 transitions. Word has length 21 [2019-12-27 19:21:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:19,697 INFO L462 AbstractCegarLoop]: Abstraction has 3680 states and 14531 transitions. [2019-12-27 19:21:19,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:21:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 14531 transitions. [2019-12-27 19:21:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:21:19,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:19,701 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 19:21:19,702 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 19:21:19,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:19,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1959403642, now seen corresponding path program 1 times [2019-12-27 19:21:19,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:19,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676556423] [2019-12-27 19:21:19,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:19,930 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 19:21:19,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676556423] [2019-12-27 19:21:19,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:19,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:21:19,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1836902789] [2019-12-27 19:21:19,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:19,934 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:19,938 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 25 transitions. [2019-12-27 19:21:19,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:19,939 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:19,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:21:19,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:19,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:21:19,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:21:19,940 INFO L87 Difference]: Start difference. First operand 3680 states and 14531 transitions. Second operand 11 states. [2019-12-27 19:21:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:20,471 INFO L93 Difference]: Finished difference Result 4556 states and 17623 transitions. [2019-12-27 19:21:20,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:20,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 19:21:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:20,483 INFO L225 Difference]: With dead ends: 4556 [2019-12-27 19:21:20,484 INFO L226 Difference]: Without dead ends: 4507 [2019-12-27 19:21:20,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:21:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-12-27 19:21:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3330. [2019-12-27 19:21:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2019-12-27 19:21:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 12802 transitions. [2019-12-27 19:21:20,578 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 12802 transitions. Word has length 21 [2019-12-27 19:21:20,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:20,578 INFO L462 AbstractCegarLoop]: Abstraction has 3330 states and 12802 transitions. [2019-12-27 19:21:20,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:21:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 12802 transitions. [2019-12-27 19:21:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:21:20,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:20,582 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 19:21:20,582 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 19:21:20,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:20,582 INFO L82 PathProgramCache]: Analyzing trace with hash -430854838, now seen corresponding path program 1 times [2019-12-27 19:21:20,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:20,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679416247] [2019-12-27 19:21:20,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:20,903 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 19:21:20,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679416247] [2019-12-27 19:21:20,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:20,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 19:21:20,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [841752635] [2019-12-27 19:21:20,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:20,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:20,912 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 29 transitions. [2019-12-27 19:21:20,913 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:20,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:20,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:21:20,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:20,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:21:20,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:21:20,916 INFO L87 Difference]: Start difference. First operand 3330 states and 12802 transitions. Second operand 12 states. [2019-12-27 19:21:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:21,424 INFO L93 Difference]: Finished difference Result 3991 states and 15112 transitions. [2019-12-27 19:21:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:21:21,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 19:21:21,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:21,432 INFO L225 Difference]: With dead ends: 3991 [2019-12-27 19:21:21,432 INFO L226 Difference]: Without dead ends: 3835 [2019-12-27 19:21:21,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:21:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2019-12-27 19:21:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 2831. [2019-12-27 19:21:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2019-12-27 19:21:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2019-12-27 19:21:21,488 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2019-12-27 19:21:21,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:21,488 INFO L462 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2019-12-27 19:21:21,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:21:21,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2019-12-27 19:21:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:21:21,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:21,493 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 19:21:21,493 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 19:21:21,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash 641940987, now seen corresponding path program 1 times [2019-12-27 19:21:21,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:21,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090992279] [2019-12-27 19:21:21,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:21,593 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 19:21:21,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090992279] [2019-12-27 19:21:21,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:21,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:21:21,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [857822437] [2019-12-27 19:21:21,594 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:21,597 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:21,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 42 transitions. [2019-12-27 19:21:21,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:21,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:21:21,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:21:21,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:21,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:21:21,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:21:21,604 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2019-12-27 19:21:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:21,876 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2019-12-27 19:21:21,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:21,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 19:21:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:21,885 INFO L225 Difference]: With dead ends: 3550 [2019-12-27 19:21:21,886 INFO L226 Difference]: Without dead ends: 3490 [2019-12-27 19:21:21,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:21:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2019-12-27 19:21:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2019-12-27 19:21:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2019-12-27 19:21:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2019-12-27 19:21:21,936 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2019-12-27 19:21:21,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:21,936 INFO L462 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2019-12-27 19:21:21,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:21:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2019-12-27 19:21:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:21:21,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:21,939 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 19:21:21,939 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 19:21:21,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash -109833189, now seen corresponding path program 2 times [2019-12-27 19:21:21,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:21,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91725437] [2019-12-27 19:21:21,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:22,042 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 19:21:22,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91725437] [2019-12-27 19:21:22,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:22,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:21:22,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2049659956] [2019-12-27 19:21:22,043 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:22,045 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:22,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 19:21:22,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:22,052 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:22,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:21:22,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:22,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:21:22,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:21:22,053 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2019-12-27 19:21:22,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:22,353 INFO L93 Difference]: Finished difference Result 3540 states and 13065 transitions. [2019-12-27 19:21:22,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:22,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 19:21:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:22,360 INFO L225 Difference]: With dead ends: 3540 [2019-12-27 19:21:22,360 INFO L226 Difference]: Without dead ends: 3480 [2019-12-27 19:21:22,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:21:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2019-12-27 19:21:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 2822. [2019-12-27 19:21:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-27 19:21:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2019-12-27 19:21:22,415 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2019-12-27 19:21:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:22,416 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2019-12-27 19:21:22,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:21:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2019-12-27 19:21:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:21:22,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:22,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, 1] [2019-12-27 19:21:22,418 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 19:21:22,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:22,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1541949331, now seen corresponding path program 3 times [2019-12-27 19:21:22,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:22,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604224843] [2019-12-27 19:21:22,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:22,544 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 19:21:22,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604224843] [2019-12-27 19:21:22,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:22,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:21:22,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [421682189] [2019-12-27 19:21:22,545 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:22,548 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:22,554 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 52 transitions. [2019-12-27 19:21:22,554 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:22,570 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:21:22,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:21:22,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:22,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:21:22,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:21:22,571 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 11 states. [2019-12-27 19:21:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:23,048 INFO L93 Difference]: Finished difference Result 3439 states and 12673 transitions. [2019-12-27 19:21:23,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 19:21:23,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-27 19:21:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:23,056 INFO L225 Difference]: With dead ends: 3439 [2019-12-27 19:21:23,056 INFO L226 Difference]: Without dead ends: 3379 [2019-12-27 19:21:23,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:21:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2019-12-27 19:21:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 2730. [2019-12-27 19:21:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2019-12-27 19:21:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10232 transitions. [2019-12-27 19:21:23,151 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10232 transitions. Word has length 22 [2019-12-27 19:21:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:23,151 INFO L462 AbstractCegarLoop]: Abstraction has 2730 states and 10232 transitions. [2019-12-27 19:21:23,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:21:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10232 transitions. [2019-12-27 19:21:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:21:23,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:23,154 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 19:21:23,154 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 19:21:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1025373391, now seen corresponding path program 4 times [2019-12-27 19:21:23,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:23,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571208716] [2019-12-27 19:21:23,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:23,327 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 19:21:23,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571208716] [2019-12-27 19:21:23,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:23,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:21:23,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164101096] [2019-12-27 19:21:23,328 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:23,330 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:23,335 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 32 transitions. [2019-12-27 19:21:23,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:23,336 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:23,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:21:23,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:23,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:21:23,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:21:23,337 INFO L87 Difference]: Start difference. First operand 2730 states and 10232 transitions. Second operand 11 states. [2019-12-27 19:21:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:23,893 INFO L93 Difference]: Finished difference Result 3588 states and 13121 transitions. [2019-12-27 19:21:23,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:21:23,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-27 19:21:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:23,902 INFO L225 Difference]: With dead ends: 3588 [2019-12-27 19:21:23,902 INFO L226 Difference]: Without dead ends: 3528 [2019-12-27 19:21:23,903 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 19:21:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2019-12-27 19:21:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2670. [2019-12-27 19:21:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2019-12-27 19:21:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2019-12-27 19:21:23,965 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2019-12-27 19:21:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:23,965 INFO L462 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2019-12-27 19:21:23,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:21:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2019-12-27 19:21:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:21:23,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:23,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 19:21:23,969 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 19:21:23,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:23,969 INFO L82 PathProgramCache]: Analyzing trace with hash -230669277, now seen corresponding path program 1 times [2019-12-27 19:21:23,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:23,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790037517] [2019-12-27 19:21:23,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:24,218 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 19:21:24,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790037517] [2019-12-27 19:21:24,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:24,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 19:21:24,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1517800442] [2019-12-27 19:21:24,219 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:24,222 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:24,226 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 31 transitions. [2019-12-27 19:21:24,226 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:24,226 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:24,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:21:24,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:21:24,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:21:24,227 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2019-12-27 19:21:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:24,732 INFO L93 Difference]: Finished difference Result 3103 states and 11113 transitions. [2019-12-27 19:21:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:21:24,733 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 19:21:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:24,740 INFO L225 Difference]: With dead ends: 3103 [2019-12-27 19:21:24,740 INFO L226 Difference]: Without dead ends: 3007 [2019-12-27 19:21:24,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:21:24,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2019-12-27 19:21:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2170. [2019-12-27 19:21:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-12-27 19:21:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2019-12-27 19:21:24,781 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 23 [2019-12-27 19:21:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:24,781 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2019-12-27 19:21:24,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:21:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2019-12-27 19:21:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:21:24,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:24,783 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 19:21:24,783 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 19:21:24,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:24,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1022800040, now seen corresponding path program 1 times [2019-12-27 19:21:24,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:24,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894078406] [2019-12-27 19:21:24,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:25,045 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 19:21:25,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894078406] [2019-12-27 19:21:25,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:25,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:21:25,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [504265247] [2019-12-27 19:21:25,046 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:25,048 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:25,054 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 55 transitions. [2019-12-27 19:21:25,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:25,056 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:21:25,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:21:25,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:25,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:21:25,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:21:25,057 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 11 states. [2019-12-27 19:21:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:25,489 INFO L93 Difference]: Finished difference Result 3115 states and 11153 transitions. [2019-12-27 19:21:25,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:21:25,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 19:21:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:25,496 INFO L225 Difference]: With dead ends: 3115 [2019-12-27 19:21:25,497 INFO L226 Difference]: Without dead ends: 3058 [2019-12-27 19:21:25,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:21:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2019-12-27 19:21:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2130. [2019-12-27 19:21:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-12-27 19:21:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7633 transitions. [2019-12-27 19:21:25,530 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7633 transitions. Word has length 23 [2019-12-27 19:21:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:25,530 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 7633 transitions. [2019-12-27 19:21:25,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:21:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7633 transitions. [2019-12-27 19:21:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:21:25,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:25,532 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 19:21:25,532 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 19:21:25,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:25,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1539375980, now seen corresponding path program 2 times [2019-12-27 19:21:25,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:25,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99858631] [2019-12-27 19:21:25,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:25,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 19:21:25,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99858631] [2019-12-27 19:21:25,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:25,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:21:25,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1360641251] [2019-12-27 19:21:25,818 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:25,821 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:25,828 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 40 transitions. [2019-12-27 19:21:25,828 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:25,831 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:21:25,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:21:25,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:25,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:21:25,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:21:25,833 INFO L87 Difference]: Start difference. First operand 2130 states and 7633 transitions. Second operand 13 states. [2019-12-27 19:21:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:26,380 INFO L93 Difference]: Finished difference Result 2799 states and 9853 transitions. [2019-12-27 19:21:26,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:21:26,381 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-27 19:21:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:26,387 INFO L225 Difference]: With dead ends: 2799 [2019-12-27 19:21:26,387 INFO L226 Difference]: Without dead ends: 2682 [2019-12-27 19:21:26,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:21:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-12-27 19:21:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1794. [2019-12-27 19:21:26,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2019-12-27 19:21:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2019-12-27 19:21:26,419 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2019-12-27 19:21:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:26,419 INFO L462 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2019-12-27 19:21:26,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:21:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2019-12-27 19:21:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 19:21:26,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:26,421 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 19:21:26,422 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 19:21:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash -396779108, now seen corresponding path program 1 times [2019-12-27 19:21:26,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:26,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713984912] [2019-12-27 19:21:26,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:26,499 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 19:21:26,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713984912] [2019-12-27 19:21:26,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:26,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:21:26,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1049696682] [2019-12-27 19:21:26,500 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:26,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:26,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 59 transitions. [2019-12-27 19:21:26,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:26,514 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:21:26,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:21:26,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:26,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:21:26,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:21:26,515 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 7 states. [2019-12-27 19:21:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:26,747 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2019-12-27 19:21:26,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:26,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-27 19:21:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:26,753 INFO L225 Difference]: With dead ends: 2291 [2019-12-27 19:21:26,753 INFO L226 Difference]: Without dead ends: 2227 [2019-12-27 19:21:26,754 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 19:21:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2019-12-27 19:21:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2019-12-27 19:21:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2019-12-27 19:21:26,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2019-12-27 19:21:26,783 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2019-12-27 19:21:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:26,784 INFO L462 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2019-12-27 19:21:26,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:21:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2019-12-27 19:21:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 19:21:26,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:26,786 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 19:21:26,786 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 19:21:26,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1742211423, now seen corresponding path program 1 times [2019-12-27 19:21:26,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:26,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511418302] [2019-12-27 19:21:26,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:26,899 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 19:21:26,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511418302] [2019-12-27 19:21:26,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:26,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:21:26,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [265272388] [2019-12-27 19:21:26,900 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:26,903 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:26,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 42 transitions. [2019-12-27 19:21:26,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:26,911 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:21:26,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:21:26,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:26,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:21:26,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:21:26,912 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 9 states. [2019-12-27 19:21:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:27,344 INFO L93 Difference]: Finished difference Result 2954 states and 10228 transitions. [2019-12-27 19:21:27,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:27,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-27 19:21:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:27,351 INFO L225 Difference]: With dead ends: 2954 [2019-12-27 19:21:27,351 INFO L226 Difference]: Without dead ends: 2930 [2019-12-27 19:21:27,352 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 19:21:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-12-27 19:21:27,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2105. [2019-12-27 19:21:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2019-12-27 19:21:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 7278 transitions. [2019-12-27 19:21:27,384 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 7278 transitions. Word has length 24 [2019-12-27 19:21:27,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:27,384 INFO L462 AbstractCegarLoop]: Abstraction has 2105 states and 7278 transitions. [2019-12-27 19:21:27,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:21:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 7278 transitions. [2019-12-27 19:21:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 19:21:27,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:27,386 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 19:21:27,386 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 19:21:27,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:27,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1800981697, now seen corresponding path program 2 times [2019-12-27 19:21:27,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:27,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019110097] [2019-12-27 19:21:27,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:27,557 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 19:21:27,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019110097] [2019-12-27 19:21:27,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:27,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:21:27,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [25850064] [2019-12-27 19:21:27,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:27,561 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:27,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 46 transitions. [2019-12-27 19:21:27,567 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:27,569 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:21:27,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:21:27,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:27,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:21:27,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:21:27,570 INFO L87 Difference]: Start difference. First operand 2105 states and 7278 transitions. Second operand 10 states. [2019-12-27 19:21:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:28,033 INFO L93 Difference]: Finished difference Result 2941 states and 10205 transitions. [2019-12-27 19:21:28,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 19:21:28,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-27 19:21:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:28,040 INFO L225 Difference]: With dead ends: 2941 [2019-12-27 19:21:28,040 INFO L226 Difference]: Without dead ends: 2917 [2019-12-27 19:21:28,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:21:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2019-12-27 19:21:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2102. [2019-12-27 19:21:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2019-12-27 19:21:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7274 transitions. [2019-12-27 19:21:28,074 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7274 transitions. Word has length 24 [2019-12-27 19:21:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:28,074 INFO L462 AbstractCegarLoop]: Abstraction has 2102 states and 7274 transitions. [2019-12-27 19:21:28,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:21:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7274 transitions. [2019-12-27 19:21:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 19:21:28,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:28,078 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 19:21:28,078 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 19:21:28,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:28,078 INFO L82 PathProgramCache]: Analyzing trace with hash 652694931, now seen corresponding path program 3 times [2019-12-27 19:21:28,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:28,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420971300] [2019-12-27 19:21:28,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:28,256 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 19:21:28,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420971300] [2019-12-27 19:21:28,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:28,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:21:28,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2079546643] [2019-12-27 19:21:28,257 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:28,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:28,266 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 19:21:28,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:28,282 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:21:28,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:21:28,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:28,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:21:28,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:21:28,283 INFO L87 Difference]: Start difference. First operand 2102 states and 7274 transitions. Second operand 12 states. [2019-12-27 19:21:28,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:28,949 INFO L93 Difference]: Finished difference Result 2554 states and 8815 transitions. [2019-12-27 19:21:28,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:21:28,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-12-27 19:21:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:28,956 INFO L225 Difference]: With dead ends: 2554 [2019-12-27 19:21:28,956 INFO L226 Difference]: Without dead ends: 2530 [2019-12-27 19:21:28,957 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 19:21:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-12-27 19:21:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 1742. [2019-12-27 19:21:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-12-27 19:21:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 5952 transitions. [2019-12-27 19:21:28,985 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 5952 transitions. Word has length 24 [2019-12-27 19:21:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:28,985 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 5952 transitions. [2019-12-27 19:21:28,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:21:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 5952 transitions. [2019-12-27 19:21:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 19:21:28,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:28,988 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 19:21:28,988 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 19:21:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:28,988 INFO L82 PathProgramCache]: Analyzing trace with hash 351528874, now seen corresponding path program 2 times [2019-12-27 19:21:28,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:28,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911380469] [2019-12-27 19:21:28,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:29,106 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 19:21:29,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911380469] [2019-12-27 19:21:29,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:29,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:21:29,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1859179152] [2019-12-27 19:21:29,107 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:29,110 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:29,118 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 48 transitions. [2019-12-27 19:21:29,118 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:29,126 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:21:29,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:21:29,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:29,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:21:29,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:21:29,127 INFO L87 Difference]: Start difference. First operand 1742 states and 5952 transitions. Second operand 8 states. [2019-12-27 19:21:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:29,331 INFO L93 Difference]: Finished difference Result 2236 states and 7383 transitions. [2019-12-27 19:21:29,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:29,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 19:21:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:29,336 INFO L225 Difference]: With dead ends: 2236 [2019-12-27 19:21:29,336 INFO L226 Difference]: Without dead ends: 2172 [2019-12-27 19:21:29,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:21:29,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-12-27 19:21:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 1739. [2019-12-27 19:21:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-12-27 19:21:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 5947 transitions. [2019-12-27 19:21:29,361 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 5947 transitions. Word has length 24 [2019-12-27 19:21:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:29,361 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 5947 transitions. [2019-12-27 19:21:29,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:21:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 5947 transitions. [2019-12-27 19:21:29,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 19:21:29,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:29,363 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 19:21:29,364 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 19:21:29,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:29,364 INFO L82 PathProgramCache]: Analyzing trace with hash -548948534, now seen corresponding path program 3 times [2019-12-27 19:21:29,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:29,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826364412] [2019-12-27 19:21:29,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:29,451 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 19:21:29,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826364412] [2019-12-27 19:21:29,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:29,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:21:29,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1884986179] [2019-12-27 19:21:29,452 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:29,455 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:29,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 50 transitions. [2019-12-27 19:21:29,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:29,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:21:29,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:21:29,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:29,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:21:29,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:21:29,471 INFO L87 Difference]: Start difference. First operand 1739 states and 5947 transitions. Second operand 9 states. [2019-12-27 19:21:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:29,729 INFO L93 Difference]: Finished difference Result 2226 states and 7363 transitions. [2019-12-27 19:21:29,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:29,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-27 19:21:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:29,735 INFO L225 Difference]: With dead ends: 2226 [2019-12-27 19:21:29,736 INFO L226 Difference]: Without dead ends: 2162 [2019-12-27 19:21:29,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:21:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2019-12-27 19:21:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1733. [2019-12-27 19:21:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-12-27 19:21:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2019-12-27 19:21:29,762 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2019-12-27 19:21:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:29,762 INFO L462 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2019-12-27 19:21:29,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:21:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2019-12-27 19:21:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 19:21:29,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:29,765 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 19:21:29,765 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 19:21:29,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:29,765 INFO L82 PathProgramCache]: Analyzing trace with hash -610918652, now seen corresponding path program 4 times [2019-12-27 19:21:29,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:29,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318127962] [2019-12-27 19:21:29,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:29,980 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 19:21:29,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318127962] [2019-12-27 19:21:29,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:29,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:21:29,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1248643961] [2019-12-27 19:21:29,981 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:29,984 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:29,991 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 19:21:29,991 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:30,003 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:21:30,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:21:30,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:30,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:21:30,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:21:30,004 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 12 states. [2019-12-27 19:21:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:30,459 INFO L93 Difference]: Finished difference Result 2165 states and 7151 transitions. [2019-12-27 19:21:30,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 19:21:30,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-12-27 19:21:30,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:30,465 INFO L225 Difference]: With dead ends: 2165 [2019-12-27 19:21:30,465 INFO L226 Difference]: Without dead ends: 2101 [2019-12-27 19:21:30,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:21:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2019-12-27 19:21:30,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 1681. [2019-12-27 19:21:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1681 states. [2019-12-27 19:21:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 5739 transitions. [2019-12-27 19:21:30,493 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 5739 transitions. Word has length 24 [2019-12-27 19:21:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:30,494 INFO L462 AbstractCegarLoop]: Abstraction has 1681 states and 5739 transitions. [2019-12-27 19:21:30,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:21:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 5739 transitions. [2019-12-27 19:21:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 19:21:30,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:30,496 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 19:21:30,497 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 19:21:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:30,497 INFO L82 PathProgramCache]: Analyzing trace with hash -847503804, now seen corresponding path program 5 times [2019-12-27 19:21:30,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:30,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166282581] [2019-12-27 19:21:30,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:30,750 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 19:21:30,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166282581] [2019-12-27 19:21:30,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:30,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:21:30,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [667791518] [2019-12-27 19:21:30,751 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:30,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:30,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 38 transitions. [2019-12-27 19:21:30,764 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:30,765 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:21:30,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:21:30,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:30,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:21:30,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:21:30,767 INFO L87 Difference]: Start difference. First operand 1681 states and 5739 transitions. Second operand 13 states. [2019-12-27 19:21:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:31,283 INFO L93 Difference]: Finished difference Result 2220 states and 7269 transitions. [2019-12-27 19:21:31,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:31,284 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-12-27 19:21:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:31,289 INFO L225 Difference]: With dead ends: 2220 [2019-12-27 19:21:31,289 INFO L226 Difference]: Without dead ends: 2092 [2019-12-27 19:21:31,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:21:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2019-12-27 19:21:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1489. [2019-12-27 19:21:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2019-12-27 19:21:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 5033 transitions. [2019-12-27 19:21:31,311 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 5033 transitions. Word has length 24 [2019-12-27 19:21:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:31,311 INFO L462 AbstractCegarLoop]: Abstraction has 1489 states and 5033 transitions. [2019-12-27 19:21:31,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:21:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 5033 transitions. [2019-12-27 19:21:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 19:21:31,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:31,313 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 19:21:31,313 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 19:21:31,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:31,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1601368368, now seen corresponding path program 1 times [2019-12-27 19:21:31,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:31,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998676663] [2019-12-27 19:21:31,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:31,468 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 19:21:31,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998676663] [2019-12-27 19:21:31,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:31,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:21:31,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [466724532] [2019-12-27 19:21:31,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:31,472 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:31,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 48 transitions. [2019-12-27 19:21:31,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:31,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:21:31,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:21:31,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:31,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:21:31,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:21:31,485 INFO L87 Difference]: Start difference. First operand 1489 states and 5033 transitions. Second operand 10 states. [2019-12-27 19:21:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:31,839 INFO L93 Difference]: Finished difference Result 2106 states and 6852 transitions. [2019-12-27 19:21:31,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:31,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-27 19:21:31,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:31,845 INFO L225 Difference]: With dead ends: 2106 [2019-12-27 19:21:31,845 INFO L226 Difference]: Without dead ends: 2084 [2019-12-27 19:21:31,845 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 19:21:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2019-12-27 19:21:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1488. [2019-12-27 19:21:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-12-27 19:21:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 5032 transitions. [2019-12-27 19:21:31,886 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 5032 transitions. Word has length 26 [2019-12-27 19:21:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:31,886 INFO L462 AbstractCegarLoop]: Abstraction has 1488 states and 5032 transitions. [2019-12-27 19:21:31,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:21:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 5032 transitions. [2019-12-27 19:21:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 19:21:31,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:31,889 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 19:21:31,890 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 19:21:31,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:31,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1793121520, now seen corresponding path program 2 times [2019-12-27 19:21:31,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:31,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535573420] [2019-12-27 19:21:31,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:32,106 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 19:21:32,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535573420] [2019-12-27 19:21:32,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:32,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:21:32,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1264290033] [2019-12-27 19:21:32,107 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:32,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:32,147 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 52 transitions. [2019-12-27 19:21:32,148 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:32,149 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:21:32,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:21:32,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:32,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:21:32,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:21:32,150 INFO L87 Difference]: Start difference. First operand 1488 states and 5032 transitions. Second operand 10 states. [2019-12-27 19:21:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:32,501 INFO L93 Difference]: Finished difference Result 2093 states and 6829 transitions. [2019-12-27 19:21:32,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 19:21:32,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-27 19:21:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:32,507 INFO L225 Difference]: With dead ends: 2093 [2019-12-27 19:21:32,507 INFO L226 Difference]: Without dead ends: 2071 [2019-12-27 19:21:32,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:21:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2019-12-27 19:21:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1485. [2019-12-27 19:21:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2019-12-27 19:21:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 5028 transitions. [2019-12-27 19:21:32,527 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 5028 transitions. Word has length 26 [2019-12-27 19:21:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:32,528 INFO L462 AbstractCegarLoop]: Abstraction has 1485 states and 5028 transitions. [2019-12-27 19:21:32,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:21:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 5028 transitions. [2019-12-27 19:21:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 19:21:32,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:32,529 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 19:21:32,530 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 19:21:32,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:32,530 INFO L82 PathProgramCache]: Analyzing trace with hash 304389942, now seen corresponding path program 3 times [2019-12-27 19:21:32,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:32,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317425712] [2019-12-27 19:21:32,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:32,748 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 19:21:32,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317425712] [2019-12-27 19:21:32,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:32,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 19:21:32,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1412426231] [2019-12-27 19:21:32,748 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:32,751 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:32,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 60 transitions. [2019-12-27 19:21:32,758 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:32,774 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:21:32,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:21:32,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:32,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:21:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:21:32,775 INFO L87 Difference]: Start difference. First operand 1485 states and 5028 transitions. Second operand 13 states. [2019-12-27 19:21:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:33,355 INFO L93 Difference]: Finished difference Result 1160 states and 3845 transitions. [2019-12-27 19:21:33,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 19:21:33,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-12-27 19:21:33,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:33,358 INFO L225 Difference]: With dead ends: 1160 [2019-12-27 19:21:33,358 INFO L226 Difference]: Without dead ends: 1116 [2019-12-27 19:21:33,358 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 19:21:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-12-27 19:21:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 885. [2019-12-27 19:21:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-12-27 19:21:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2019-12-27 19:21:33,369 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2019-12-27 19:21:33,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:33,370 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2019-12-27 19:21:33,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:21:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2019-12-27 19:21:33,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 19:21:33,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:33,372 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 19:21:33,372 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 19:21:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:33,372 INFO L82 PathProgramCache]: Analyzing trace with hash -720297978, now seen corresponding path program 1 times [2019-12-27 19:21:33,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:33,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016622115] [2019-12-27 19:21:33,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:33,455 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 19:21:33,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016622115] [2019-12-27 19:21:33,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:33,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:21:33,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [817202774] [2019-12-27 19:21:33,456 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:33,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:33,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 189 transitions. [2019-12-27 19:21:33,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:33,504 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:21:33,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:21:33,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:33,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:21:33,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:21:33,505 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2019-12-27 19:21:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:33,637 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2019-12-27 19:21:33,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:21:33,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 19:21:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:33,639 INFO L225 Difference]: With dead ends: 885 [2019-12-27 19:21:33,640 INFO L226 Difference]: Without dead ends: 879 [2019-12-27 19:21:33,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:21:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-12-27 19:21:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2019-12-27 19:21:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-12-27 19:21:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2019-12-27 19:21:33,655 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2019-12-27 19:21:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:33,655 INFO L462 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2019-12-27 19:21:33,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:21:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2019-12-27 19:21:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 19:21:33,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:33,657 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 19:21:33,657 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 19:21:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash 525302158, now seen corresponding path program 1 times [2019-12-27 19:21:33,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:33,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432378763] [2019-12-27 19:21:33,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:33,757 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 19:21:33,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432378763] [2019-12-27 19:21:33,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:33,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:21:33,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1406412278] [2019-12-27 19:21:33,758 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:33,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:33,826 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 197 transitions. [2019-12-27 19:21:33,826 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:33,828 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:21:33,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:21:33,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:33,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:21:33,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:21:33,829 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2019-12-27 19:21:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:33,992 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2019-12-27 19:21:33,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:21:33,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 19:21:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:33,995 INFO L225 Difference]: With dead ends: 879 [2019-12-27 19:21:33,995 INFO L226 Difference]: Without dead ends: 819 [2019-12-27 19:21:33,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:21:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-12-27 19:21:34,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2019-12-27 19:21:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-27 19:21:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2019-12-27 19:21:34,011 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2019-12-27 19:21:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:34,012 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2019-12-27 19:21:34,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:21:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2019-12-27 19:21:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 19:21:34,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:34,014 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 19:21:34,017 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 19:21:34,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:34,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1075124498, now seen corresponding path program 1 times [2019-12-27 19:21:34,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:34,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334670124] [2019-12-27 19:21:34,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:21:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:21:34,104 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:21:34,105 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:21:34,109 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_~v~0.offset_23 0) (= 0 |v_#NULL.base_4|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t~0.base_18|) (= (store |v_#length_40| |v_ULTIMATE.start_main_~#t~0.base_18| 4) |v_#length_39|) (= |v_#memory_int_65| (store |v_#memory_int_66| |v_ULTIMATE.start_main_~#t~0.base_18| (store (select |v_#memory_int_66| |v_ULTIMATE.start_main_~#t~0.base_18|) |v_ULTIMATE.start_main_~#t~0.offset_14| 5))) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t~0.base_18|)) (< 0 |v_#StackHeapBarrier_22|) (= v_~v~0.base_23 0) (= |v_#valid_111| (store .cse0 |v_ULTIMATE.start_main_~#t~0.base_18| 1)) (= |v_ULTIMATE.start_main_~#t~0.offset_14| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_113|, #memory_int=|v_#memory_int_66|, #length=|v_#length_40|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_7|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|, ~v~0.base=v_~v~0.base_23, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~v~0.offset=v_~v~0.offset_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_13|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_65|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_18|, #length=|v_#length_39|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_19|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_30|} 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 19:21:34,110 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 ((.cse1 (store .cse3 |v_thread0Thread1of1ForFork3_~#t2~0.base_17| 1))) (let ((.cse0 (store .cse1 |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 1))) (let ((.cse2 (store .cse0 |v_thread0Thread1of1ForFork3_~#t4~0.base_17| 1))) (and (= 0 (select .cse0 |v_thread0Thread1of1ForFork3_~#t4~0.base_17|)) (= 0 (select .cse1 |v_thread0Thread1of1ForFork3_~#t3~0.base_16|)) (not (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.base_17|)) (= (select .cse2 |v_thread0Thread1of1ForFork3_~#t5~0.base_15|) 0) (= 0 |v_thread0Thread1of1ForFork3_~#t3~0.offset_13|) (= v_thread0Thread1of1ForFork3_~arg.offset_6 |v_thread0Thread1of1ForFork3_#in~arg.offset_6|) (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.offset_13|) (= |v_#length_36| (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_16| 4) |v_thread0Thread1of1ForFork3_~#t4~0.base_17| 4) |v_thread0Thread1of1ForFork3_~#t5~0.base_15| 4)) (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.offset_14|) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t3~0.base_16|) (not (= |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 0)) (not (= |v_thread0Thread1of1ForFork3_~#t1~0.base_18| 0)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t2~0.base_17|) (= (store |v_#memory_int_64| |v_thread0Thread1of1ForFork3_~#t1~0.base_18| (store (select |v_#memory_int_64| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) |v_thread0Thread1of1ForFork3_~#t1~0.offset_14| 0)) |v_#memory_int_63|) (= |v_thread0Thread1of1ForFork3_~#t5~0.offset_11| 0) (= v_thread0Thread1of1ForFork3_~arg.base_6 |v_thread0Thread1of1ForFork3_#in~arg.base_6|) (not (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.base_17|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) (= |v_#valid_102| (store .cse2 |v_thread0Thread1of1ForFork3_~#t5~0.base_15| 1)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t5~0.base_15|) (= 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 (= 0 |v_thread0Thread1of1ForFork3_~#t5~0.base_15|)) (< |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_64|, #length=|v_#length_38|, thread0Thread1of1ForFork3_#in~arg.base=|v_thread0Thread1of1ForFork3_#in~arg.base_6|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_16|, 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_13|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_18|, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_63|, 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_15|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_11|} 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 19:21:34,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [424] [424] L1108-1-->L1109-1: Formula: (= (select (select |v_#memory_int_40| |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_40|, 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_40|, 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 19:21:34,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [428] [428] L1123-1-->L1124-1: Formula: (= (select (select |v_#memory_int_43| |v_ULTIMATE.start_main_~#t~0.base_10|) |v_ULTIMATE.start_main_~#t~0.offset_10|) |v_ULTIMATE.start_main_#t~mem14_27|) InVars {#memory_int=|v_#memory_int_43|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_10|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_10|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-12-27 19:21:34,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [462] [462] thread1ENTRY-->thread1EXIT: Formula: (and (= 0 |v_thread1Thread1of1ForFork4_#res.base_7|) (= 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_~v~0.base_22) (< |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| |v_#StackHeapBarrier_20|) (= |v_#valid_98| (store |v_#valid_99| |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| 1)) (= v_~v~0.offset_22 |v_thread1Thread1of1ForFork4_#t~malloc2.offset_9|) (= 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_22, #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_22, #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 19:21:34,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [443] [443] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork5_#res.offset_7| 0) (= (store |v_#memory_int_53| v_~v~0.base_13 (store (select |v_#memory_int_53| v_~v~0.base_13) v_~v~0.offset_13 88)) |v_#memory_int_52|) (= 0 |v_thread2Thread1of1ForFork5_#res.base_7|)) InVars {~v~0.offset=v_~v~0.offset_13, #memory_int=|v_#memory_int_53|, ~v~0.base=v_~v~0.base_13} OutVars{~v~0.offset=v_~v~0.offset_13, #memory_int=|v_#memory_int_52|, thread2Thread1of1ForFork5_#res.base=|v_thread2Thread1of1ForFork5_#res.base_7|, thread2Thread1of1ForFork5_#res.offset=|v_thread2Thread1of1ForFork5_#res.offset_7|, ~v~0.base=v_~v~0.base_13} AuxVars[] AssignedVars[#memory_int, thread2Thread1of1ForFork5_#res.base, thread2Thread1of1ForFork5_#res.offset] because there is no mapped edge [2019-12-27 19:21:34,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [412] [412] L1110-2-->L1111-1: Formula: (= (store |v_#memory_int_33| |v_thread0Thread1of1ForFork3_~#t3~0.base_11| (store (select |v_#memory_int_33| |v_thread0Thread1of1ForFork3_~#t3~0.base_11|) |v_thread0Thread1of1ForFork3_~#t3~0.offset_9| 2)) |v_#memory_int_32|) 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_33|} 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_32|, thread0Thread1of1ForFork3_#t~nondet5=|v_thread0Thread1of1ForFork3_#t~nondet5_4|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet5] because there is no mapped edge [2019-12-27 19:21:34,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [417] [417] L1111-2-->L1112-1: Formula: (= (store |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t4~0.base_10| (store (select |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t4~0.base_10|) |v_thread0Thread1of1ForFork3_~#t4~0.offset_9| 3)) |v_#memory_int_36|) InVars {thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_9|, #memory_int=|v_#memory_int_37|, 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_36|, 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 19:21:34,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [411] [411] L1112-2-->L1113-1: Formula: (= (store |v_#memory_int_31| |v_thread0Thread1of1ForFork3_~#t5~0.base_10| (store (select |v_#memory_int_31| |v_thread0Thread1of1ForFork3_~#t5~0.base_10|) |v_thread0Thread1of1ForFork3_~#t5~0.offset_8| 4)) |v_#memory_int_30|) InVars {#memory_int=|v_#memory_int_31|, 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_30|, 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 19:21:34,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [435] [435] L1113-2-->L1114-1: Formula: (= (select (select |v_#memory_int_50| |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_50|, 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_50|, 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 19:21:34,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [449] [449] L1097-->thread2EXIT: Formula: (and (= (store |v_#memory_int_59| v_~v~0.base_17 (store (select |v_#memory_int_59| v_~v~0.base_17) v_~v~0.offset_17 88)) |v_#memory_int_58|) (= |v_thread2Thread1of1ForFork2_#res.offset_7| 0) (= |v_thread2Thread1of1ForFork2_#res.base_7| 0)) InVars {~v~0.offset=v_~v~0.offset_17, #memory_int=|v_#memory_int_59|, ~v~0.base=v_~v~0.base_17} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_7|, ~v~0.offset=v_~v~0.offset_17, #memory_int=|v_#memory_int_58|, ~v~0.base=v_~v~0.base_17, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, #memory_int, thread2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 19:21:34,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [446] [446] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0) (= (store |v_#memory_int_55| v_~v~0.base_14 (store (select |v_#memory_int_55| v_~v~0.base_14) v_~v~0.offset_14 88)) |v_#memory_int_54|)) InVars {~v~0.offset=v_~v~0.offset_14, #memory_int=|v_#memory_int_55|, ~v~0.base=v_~v~0.base_14} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~v~0.offset=v_~v~0.offset_14, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|, #memory_int=|v_#memory_int_54|, ~v~0.base=v_~v~0.base_14} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, #memory_int] because there is no mapped edge [2019-12-27 19:21:34,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [448] [448] L1102-->thread3EXIT: Formula: (and (= (store |v_#memory_int_57| v_~v~0.base_16 (store (select |v_#memory_int_57| v_~v~0.base_16) v_~v~0.offset_16 89)) |v_#memory_int_56|) (= |v_thread3Thread1of1ForFork0_#res.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res.base_7| 0)) InVars {~v~0.offset=v_~v~0.offset_16, #memory_int=|v_#memory_int_57|, ~v~0.base=v_~v~0.base_16} OutVars{~v~0.offset=v_~v~0.offset_16, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_7|, #memory_int=|v_#memory_int_56|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_7|, ~v~0.base=v_~v~0.base_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 19:21:34,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [470] [470] L1118-->thread0EXIT: Formula: (and (= 0 |v_thread0Thread1of1ForFork3_#res.offset_4|) (= (store (store (store (store (store |v_#valid_117| |v_thread0Thread1of1ForFork3_~#t1~0.base_22| 0) |v_thread0Thread1of1ForFork3_~#t2~0.base_21| 0) |v_thread0Thread1of1ForFork3_~#t3~0.base_20| 0) |v_thread0Thread1of1ForFork3_~#t4~0.base_21| 0) |v_thread0Thread1of1ForFork3_~#t5~0.base_19| 0) |v_#valid_116|) (= 0 |v_thread0Thread1of1ForFork3_#res.base_4|)) InVars {thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_20|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_22|, #valid=|v_#valid_117|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_21|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_19|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_21|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_19|, 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_15|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_21|, thread0Thread1of1ForFork3_#res.offset=|v_thread0Thread1of1ForFork3_#res.offset_4|, #valid=|v_#valid_116|, 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_18|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_13|} 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 19:21:34,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [457] [457] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= |v_ULTIMATE.start_main_#t~mem15_15| 88)) (= |v_ULTIMATE.start_main_#t~mem15_15| (select (select |v_#memory_int_61| v_~v~0.base_20) v_~v~0.offset_20)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~v~0.offset=v_~v~0.offset_20, #memory_int=|v_#memory_int_61|, ~v~0.base=v_~v~0.base_20} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~v~0.offset=v_~v~0.offset_20, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_15|, ~v~0.base=v_~v~0.base_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} 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 19:21:34,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:21:34 BasicIcfg [2019-12-27 19:21:34,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:21:34,216 INFO L168 Benchmark]: Toolchain (without parser) took 33255.33 ms. Allocated memory was 136.3 MB in the beginning and 838.9 MB in the end (delta: 702.5 MB). Free memory was 97.6 MB in the beginning and 295.7 MB in the end (delta: -198.1 MB). Peak memory consumption was 504.4 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:34,216 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 19:21:34,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 954.38 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 97.2 MB in the beginning and 120.1 MB in the end (delta: -22.9 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:34,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.64 ms. Allocated memory is still 201.3 MB. Free memory was 120.1 MB in the beginning and 118.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:34,217 INFO L168 Benchmark]: Boogie Preprocessor took 38.23 ms. Allocated memory is still 201.3 MB. Free memory was 118.0 MB in the beginning and 116.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:34,218 INFO L168 Benchmark]: RCFGBuilder took 521.30 ms. Allocated memory is still 201.3 MB. Free memory was 116.5 MB in the beginning and 89.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:34,218 INFO L168 Benchmark]: TraceAbstraction took 31670.28 ms. Allocated memory was 201.3 MB in the beginning and 838.9 MB in the end (delta: 637.5 MB). Free memory was 89.7 MB in the beginning and 295.7 MB in the end (delta: -206.0 MB). Peak memory consumption was 431.5 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:34,225 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.24 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 954.38 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 97.2 MB in the beginning and 120.1 MB in the end (delta: -22.9 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.64 ms. Allocated memory is still 201.3 MB. Free memory was 120.1 MB in the beginning and 118.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.23 ms. Allocated memory is still 201.3 MB. Free memory was 118.0 MB in the beginning and 116.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 521.30 ms. Allocated memory is still 201.3 MB. Free memory was 116.5 MB in the beginning and 89.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31670.28 ms. Allocated memory was 201.3 MB in the beginning and 838.9 MB in the end (delta: 637.5 MB). Free memory was 89.7 MB in the beginning and 295.7 MB in the end (delta: -206.0 MB). Peak memory consumption was 431.5 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, 1460 VarBasedMoverChecksPositive, 10 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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={10:0}, t2={11:0}, t3={6:0}, t4={8:0}, t5={9: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: 31.2s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4103 SDtfs, 7515 SDslu, 13297 SDs, 0 SdLazy, 8054 SolverSat, 1034 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 140 SyntacticMatches, 20 SemanticMatches, 472 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4270occurred 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.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 30604 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 903 NumberOfCodeBlocks, 903 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 823 ConstructedInterpolants, 0 QuantifiedInterpolants, 266260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...