/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:58:49,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:58:49,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:58:49,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:58:49,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:58:49,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:58:49,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:58:49,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:58:49,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:58:49,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:58:49,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:58:49,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:58:49,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:58:49,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:58:49,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:58:49,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:58:49,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:58:49,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:58:49,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:58:49,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:58:49,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:58:49,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:58:49,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:58:49,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:58:49,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:58:49,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:58:49,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:58:49,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:58:49,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:58:49,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:58:49,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:58:49,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:58:49,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:58:49,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:58:49,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:58:49,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:58:49,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:58:49,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:58:49,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:58:49,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:58:49,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:58:49,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:58:49,739 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:58:49,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:58:49,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:58:49,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:58:49,742 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:58:49,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:58:49,742 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:58:49,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:58:49,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:58:49,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:58:49,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:58:49,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:58:49,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:58:49,744 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:58:49,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:58:49,745 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:58:49,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:58:49,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:58:49,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:58:49,745 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:58:49,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:58:49,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:58:49,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:58:49,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:58:49,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:58:49,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:58:49,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:58:49,749 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:58:49,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:58:49,749 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:58:49,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:58:50,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:58:50,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:58:50,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:58:50,052 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:58:50,052 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:58:50,053 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2019-12-27 18:58:50,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6416f1af2/b18f3e9fa87d43d3a67eaef18239955a/FLAG7d86072ee [2019-12-27 18:58:50,779 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:58:50,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2019-12-27 18:58:50,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6416f1af2/b18f3e9fa87d43d3a67eaef18239955a/FLAG7d86072ee [2019-12-27 18:58:50,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6416f1af2/b18f3e9fa87d43d3a67eaef18239955a [2019-12-27 18:58:50,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:58:50,963 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:58:50,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:58:50,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:58:50,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:58:50,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:58:50" (1/1) ... [2019-12-27 18:58:50,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d92334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:50, skipping insertion in model container [2019-12-27 18:58:50,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:58:50" (1/1) ... [2019-12-27 18:58:50,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:58:51,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:58:51,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:58:51,865 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:58:51,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:58:52,345 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:58:52,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52 WrapperNode [2019-12-27 18:58:52,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:58:52,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:58:52,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:58:52,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:58:52,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52" (1/1) ... [2019-12-27 18:58:52,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52" (1/1) ... [2019-12-27 18:58:52,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:58:52,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:58:52,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:58:52,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:58:52,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52" (1/1) ... [2019-12-27 18:58:52,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52" (1/1) ... [2019-12-27 18:58:52,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52" (1/1) ... [2019-12-27 18:58:52,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52" (1/1) ... [2019-12-27 18:58:52,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52" (1/1) ... [2019-12-27 18:58:52,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52" (1/1) ... [2019-12-27 18:58:52,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52" (1/1) ... [2019-12-27 18:58:52,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:58:52,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:58:52,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:58:52,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:58:52,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52" (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 18:58:52,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:58:52,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 18:58:52,557 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-27 18:58:52,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 18:58:52,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:58:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:58:52,558 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-27 18:58:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-27 18:58:52,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:58:52,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:58:52,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 18:58:52,561 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 18:58:53,312 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:58:53,313 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-27 18:58:53,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:58:53 BoogieIcfgContainer [2019-12-27 18:58:53,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:58:53,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:58:53,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:58:53,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:58:53,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:58:50" (1/3) ... [2019-12-27 18:58:53,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa3fe7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:58:53, skipping insertion in model container [2019-12-27 18:58:53,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52" (2/3) ... [2019-12-27 18:58:53,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa3fe7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:58:53, skipping insertion in model container [2019-12-27 18:58:53,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:58:53" (3/3) ... [2019-12-27 18:58:53,324 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2019-12-27 18:58:53,333 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:58:53,333 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:58:53,341 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-27 18:58:53,342 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:58:53,379 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,379 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,379 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,380 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,380 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,380 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,380 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,381 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,381 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,381 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,381 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,382 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,382 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,382 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,382 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,382 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,383 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,383 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,383 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,384 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,384 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,384 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,388 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,389 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,393 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,393 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,394 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,394 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,395 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,395 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,395 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,396 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,397 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,397 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,397 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,398 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,398 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,399 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,399 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,399 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,400 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,400 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,400 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,401 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,401 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,401 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,401 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,402 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,402 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,402 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,402 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,403 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,403 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,403 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,403 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,403 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,404 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,404 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,404 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,405 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,405 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,405 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,405 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,405 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,406 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,406 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,407 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,407 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,407 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,407 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,412 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,413 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,413 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,413 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,413 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,414 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,414 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,414 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,414 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,415 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,415 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,416 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,423 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,424 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,424 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,424 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,425 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,426 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,426 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,426 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,426 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,427 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,427 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,427 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:53,462 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 18:58:53,483 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:58:53,483 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:58:53,484 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:58:53,484 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:58:53,484 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:58:53,484 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:58:53,484 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:58:53,485 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:58:53,507 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 157 transitions [2019-12-27 18:58:53,509 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 157 transitions [2019-12-27 18:58:53,631 INFO L132 PetriNetUnfolder]: 13/215 cut-off events. [2019-12-27 18:58:53,632 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 18:58:53,644 INFO L76 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 215 events. 13/215 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 443 event pairs. 0/191 useless extension candidates. Maximal degree in co-relation 97. Up to 4 conditions per place. [2019-12-27 18:58:53,655 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 157 transitions [2019-12-27 18:58:53,752 INFO L132 PetriNetUnfolder]: 13/215 cut-off events. [2019-12-27 18:58:53,753 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 18:58:53,759 INFO L76 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 215 events. 13/215 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 443 event pairs. 0/191 useless extension candidates. Maximal degree in co-relation 97. Up to 4 conditions per place. [2019-12-27 18:58:53,769 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4004 [2019-12-27 18:58:53,771 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:58:54,064 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:54,096 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:54,102 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:54,122 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:54,123 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:54,124 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2019-12-27 18:58:54,294 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:54,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:54,337 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:54,368 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:54,369 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:54,369 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:58:54,388 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:54,431 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:54,437 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:54,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:54,475 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:54,476 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:58:57,662 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:57,700 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:57,728 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:57,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:57,767 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:57,768 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:58:57,783 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:57,820 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:57,827 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:57,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:57,869 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:57,870 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:58:59,933 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:59,971 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:59,977 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:00,006 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:00,007 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:00,007 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:00,026 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:00,066 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:00,070 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:00,112 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:00,113 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:00,113 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:02,132 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:02,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:02,174 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:02,202 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:02,203 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:02,204 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:02,228 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:02,257 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:02,263 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:02,309 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:02,310 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:02,310 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:07,222 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:07,282 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:07,288 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:07,327 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:07,328 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:07,329 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:07,343 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:07,377 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:07,383 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:07,419 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:07,419 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:07,420 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:09,433 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:09,467 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:09,472 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:09,499 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:09,500 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:09,500 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:09,519 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:09,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:09,577 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:09,605 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:09,606 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:09,606 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:11,668 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,702 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:11,705 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,729 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:11,730 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,730 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-27 18:59:11,889 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,922 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:11,926 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:11,954 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,955 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:11,968 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:12,005 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:12,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:12,031 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:12,031 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:14,754 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-12-27 18:59:14,765 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:14,883 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 18:59:14,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:14,891 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:14,983 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:14,984 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:14,984 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:160 [2019-12-27 18:59:15,087 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-27 18:59:15,823 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-12-27 18:59:16,217 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-12-27 18:59:16,450 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-12-27 18:59:16,771 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-12-27 18:59:17,119 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-12-27 18:59:17,249 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-27 18:59:17,973 WARN L192 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2019-12-27 18:59:18,236 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-12-27 18:59:19,322 WARN L192 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 122 DAG size of output: 118 [2019-12-27 18:59:19,780 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-12-27 18:59:19,792 INFO L206 etLargeBlockEncoding]: Checked pairs total: 8278 [2019-12-27 18:59:19,793 INFO L214 etLargeBlockEncoding]: Total number of compositions: 160 [2019-12-27 18:59:19,797 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 45 transitions [2019-12-27 18:59:19,830 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 532 states. [2019-12-27 18:59:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states. [2019-12-27 18:59:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 18:59:19,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:59:19,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 18:59:19,840 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:59:19,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:59:19,846 INFO L82 PathProgramCache]: Analyzing trace with hash 17185309, now seen corresponding path program 1 times [2019-12-27 18:59:19,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:59:19,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481255718] [2019-12-27 18:59:19,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:59:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:59:20,282 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 18:59:20,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481255718] [2019-12-27 18:59:20,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:59:20,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:59:20,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [161458574] [2019-12-27 18:59:20,286 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:59:20,290 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:59:20,303 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 18:59:20,304 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:59:20,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:59:20,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:59:20,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:59:20,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:59:20,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:59:20,321 INFO L87 Difference]: Start difference. First operand 532 states. Second operand 3 states. [2019-12-27 18:59:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:59:20,510 INFO L93 Difference]: Finished difference Result 687 states and 1665 transitions. [2019-12-27 18:59:20,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:59:20,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 18:59:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:59:20,532 INFO L225 Difference]: With dead ends: 687 [2019-12-27 18:59:20,533 INFO L226 Difference]: Without dead ends: 612 [2019-12-27 18:59:20,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 18:59:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-12-27 18:59:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 516. [2019-12-27 18:59:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-12-27 18:59:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1218 transitions. [2019-12-27 18:59:20,631 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1218 transitions. Word has length 4 [2019-12-27 18:59:20,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:59:20,632 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 1218 transitions. [2019-12-27 18:59:20,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:59:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1218 transitions. [2019-12-27 18:59:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 18:59:20,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:59:20,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 18:59:20,633 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:59:20,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:59:20,633 INFO L82 PathProgramCache]: Analyzing trace with hash -664803785, now seen corresponding path program 1 times [2019-12-27 18:59:20,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:59:20,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514423995] [2019-12-27 18:59:20,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:59:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:59:20,729 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 18:59:20,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514423995] [2019-12-27 18:59:20,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:59:20,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:59:20,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1565439460] [2019-12-27 18:59:20,730 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:59:20,731 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:59:20,732 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 7 states and 6 transitions. [2019-12-27 18:59:20,732 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:59:20,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:59:20,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:59:20,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:59:20,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:59:20,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:59:20,734 INFO L87 Difference]: Start difference. First operand 516 states and 1218 transitions. Second operand 4 states. [2019-12-27 18:59:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:59:20,965 INFO L93 Difference]: Finished difference Result 671 states and 1561 transitions. [2019-12-27 18:59:20,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:59:20,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-27 18:59:20,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:59:20,969 INFO L225 Difference]: With dead ends: 671 [2019-12-27 18:59:20,970 INFO L226 Difference]: Without dead ends: 586 [2019-12-27 18:59:20,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:59:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-12-27 18:59:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 554. [2019-12-27 18:59:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-12-27 18:59:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1327 transitions. [2019-12-27 18:59:20,996 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1327 transitions. Word has length 6 [2019-12-27 18:59:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:59:20,997 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 1327 transitions. [2019-12-27 18:59:20,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:59:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1327 transitions. [2019-12-27 18:59:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 18:59:20,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:59:20,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:59:20,999 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:59:20,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:59:20,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1722397114, now seen corresponding path program 1 times [2019-12-27 18:59:21,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:59:21,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597494566] [2019-12-27 18:59:21,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:59:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:59:21,062 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 18:59:21,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597494566] [2019-12-27 18:59:21,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:59:21,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:59:21,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [679649393] [2019-12-27 18:59:21,064 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:59:21,065 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:59:21,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 18 transitions. [2019-12-27 18:59:21,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:59:21,118 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:59:21,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:59:21,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:59:21,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:59:21,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:59:21,119 INFO L87 Difference]: Start difference. First operand 554 states and 1327 transitions. Second operand 5 states. [2019-12-27 18:59:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:59:21,227 INFO L93 Difference]: Finished difference Result 282 states and 571 transitions. [2019-12-27 18:59:21,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:59:21,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-27 18:59:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:59:21,230 INFO L225 Difference]: With dead ends: 282 [2019-12-27 18:59:21,231 INFO L226 Difference]: Without dead ends: 282 [2019-12-27 18:59:21,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:59:21,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-27 18:59:21,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-12-27 18:59:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-27 18:59:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 479 transitions. [2019-12-27 18:59:21,239 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 479 transitions. Word has length 10 [2019-12-27 18:59:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:59:21,240 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 479 transitions. [2019-12-27 18:59:21,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:59:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 479 transitions. [2019-12-27 18:59:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 18:59:21,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:59:21,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:59:21,249 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:59:21,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:59:21,249 INFO L82 PathProgramCache]: Analyzing trace with hash -844855109, now seen corresponding path program 1 times [2019-12-27 18:59:21,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:59:21,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574198765] [2019-12-27 18:59:21,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:59:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:59:21,366 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 18:59:21,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574198765] [2019-12-27 18:59:21,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:59:21,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:59:21,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [408832525] [2019-12-27 18:59:21,369 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:59:21,374 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:59:21,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 26 transitions. [2019-12-27 18:59:21,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:59:21,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:59:21,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:59:21,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:59:21,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:59:21,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:59:21,381 INFO L87 Difference]: Start difference. First operand 234 states and 479 transitions. Second operand 3 states. [2019-12-27 18:59:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:59:21,528 INFO L93 Difference]: Finished difference Result 279 states and 550 transitions. [2019-12-27 18:59:21,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:59:21,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 18:59:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:59:21,531 INFO L225 Difference]: With dead ends: 279 [2019-12-27 18:59:21,531 INFO L226 Difference]: Without dead ends: 279 [2019-12-27 18:59:21,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 18:59:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-27 18:59:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 246. [2019-12-27 18:59:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-27 18:59:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 499 transitions. [2019-12-27 18:59:21,539 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 499 transitions. Word has length 16 [2019-12-27 18:59:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:59:21,540 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 499 transitions. [2019-12-27 18:59:21,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:59:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 499 transitions. [2019-12-27 18:59:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:59:21,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:59:21,544 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 18:59:21,544 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:59:21,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:59:21,544 INFO L82 PathProgramCache]: Analyzing trace with hash -420706071, now seen corresponding path program 1 times [2019-12-27 18:59:21,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:59:21,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806197015] [2019-12-27 18:59:21,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:59:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:59:21,615 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 18:59:21,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806197015] [2019-12-27 18:59:21,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:59:21,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:59:21,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1654281538] [2019-12-27 18:59:21,617 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:59:21,620 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:59:21,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 27 transitions. [2019-12-27 18:59:21,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:59:21,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:59:21,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:59:21,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:59:21,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:59:21,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:59:21,627 INFO L87 Difference]: Start difference. First operand 246 states and 499 transitions. Second operand 3 states. [2019-12-27 18:59:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:59:21,738 INFO L93 Difference]: Finished difference Result 283 states and 556 transitions. [2019-12-27 18:59:21,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:59:21,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 18:59:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:59:21,740 INFO L225 Difference]: With dead ends: 283 [2019-12-27 18:59:21,741 INFO L226 Difference]: Without dead ends: 283 [2019-12-27 18:59:21,741 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 18:59:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-27 18:59:21,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 258. [2019-12-27 18:59:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-12-27 18:59:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 527 transitions. [2019-12-27 18:59:21,749 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 527 transitions. Word has length 17 [2019-12-27 18:59:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:59:21,749 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 527 transitions. [2019-12-27 18:59:21,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:59:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 527 transitions. [2019-12-27 18:59:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:59:21,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:59:21,751 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 18:59:21,751 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:59:21,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:59:21,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1300998096, now seen corresponding path program 1 times [2019-12-27 18:59:21,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:59:21,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647294653] [2019-12-27 18:59:21,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:59:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:59:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:59:21,888 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:59:21,888 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:59:21,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [532] [532] ULTIMATE.startENTRY-->L1713-1: Formula: (let ((.cse5 (store |v_#valid_86| 0 0))) (let ((.cse6 (store .cse5 |v_~#t1~0.base_21| 1))) (let ((.cse1 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_18 24)) (.cse2 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_18 28)) (.cse3 (store .cse6 |v_~#t2~0.base_22| 1))) (and (= (let ((.cse0 (store |v_#memory_$Pointer$.base_258| v_ULTIMATE.start_my_drv_probe_~data.base_18 (store (store (select |v_#memory_$Pointer$.base_258| v_ULTIMATE.start_my_drv_probe_~data.base_18) .cse1 v_DerPreprocessor_59) .cse2 v_DerPreprocessor_57)))) (store .cse0 |v_~#t1~0.base_21| (store (select .cse0 |v_~#t1~0.base_21|) |v_~#t1~0.offset_21| (select (select |v_#memory_$Pointer$.base_257| |v_~#t1~0.base_21|) |v_~#t1~0.offset_21|)))) |v_#memory_$Pointer$.base_257|) (= (store .cse3 |v_ULTIMATE.start_main_~#data~1.base_111| 1) |v_#valid_84|) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#data~1.base_111|) (= |v_#memory_int_302| (let ((.cse4 (store |v_#memory_int_303| v_ULTIMATE.start_my_drv_probe_~data.base_18 (store (store (select |v_#memory_int_303| v_ULTIMATE.start_my_drv_probe_~data.base_18) .cse1 0) .cse2 0)))) (store .cse4 |v_~#t1~0.base_21| (store (select .cse4 |v_~#t1~0.base_21|) |v_~#t1~0.offset_21| 0)))) (= |v_ULTIMATE.start_my_drv_probe_#in~data.offset_15| v_ULTIMATE.start_my_drv_probe_~data.offset_18) (= v_ULTIMATE.start_my_drv_probe_~d~0.base_17 v_ULTIMATE.start_my_drv_probe_~data.base_18) (= |v_~#t1~0.offset_21| 0) (= (select .cse5 |v_~#t1~0.base_21|) 0) (= (store (store (store |v_#length_48| |v_~#t1~0.base_21| 4) |v_~#t2~0.base_22| 4) |v_ULTIMATE.start_main_~#data~1.base_111| 32) |v_#length_46|) (= |v_ULTIMATE.start_my_drv_probe_#in~data.base_15| |v_ULTIMATE.start_main_~#data~1.base_111|) (= |v_ULTIMATE.start_my_drv_probe_#in~data.base_15| v_ULTIMATE.start_my_drv_probe_~data.base_18) (= |v_ULTIMATE.start_my_drv_probe_#in~data.offset_15| |v_ULTIMATE.start_main_~#data~1.offset_105|) (= |v_~#t2~0.offset_22| 0) (< |v_#StackHeapBarrier_24| |v_~#t1~0.base_21|) (= (select .cse6 |v_~#t2~0.base_22|) 0) (= 0 |v_ULTIMATE.start_main_~#data~1.offset_105|) (< |v_#StackHeapBarrier_24| |v_~#t2~0.base_22|) (= |v_#NULL.offset_5| 0) (= 0 |v_ULTIMATE.start_my_drv_init_#res_16|) (= v_ULTIMATE.start_my_drv_probe_~res~0_22 0) (= 0 v_ULTIMATE.start_main_~ret~0_22) (= v_ULTIMATE.start_my_drv_probe_~d~0.offset_17 .cse1) (= |v_#memory_$Pointer$.offset_257| (let ((.cse7 (store |v_#memory_$Pointer$.offset_258| v_ULTIMATE.start_my_drv_probe_~data.base_18 (store (store (select |v_#memory_$Pointer$.offset_258| v_ULTIMATE.start_my_drv_probe_~data.base_18) .cse1 v_DerPreprocessor_58) .cse2 v_DerPreprocessor_60)))) (store .cse7 |v_~#t1~0.base_21| (store (select .cse7 |v_~#t1~0.base_21|) |v_~#t1~0.offset_21| (select (select |v_#memory_$Pointer$.offset_257| |v_~#t1~0.base_21|) |v_~#t1~0.offset_21|))))) (= 0 (select .cse3 |v_ULTIMATE.start_main_~#data~1.base_111|)) (= (select (select |v_#memory_int_303| |v_~#t1~0.base_21|) |v_~#t1~0.offset_21|) 0) (= 0 |v_#NULL.base_5|) (= (select (select |v_#memory_int_303| |v_~#t2~0.base_22|) |v_~#t2~0.offset_22|) 0) (= |v_#pthreadsMutex_157| (store |v_#pthreadsMutex_158| v_ULTIMATE.start_my_drv_probe_~data.base_18 (store (select |v_#pthreadsMutex_158| v_ULTIMATE.start_my_drv_probe_~data.base_18) v_ULTIMATE.start_my_drv_probe_~data.offset_18 0))) (< 0 |v_#StackHeapBarrier_24|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_158|, #StackHeapBarrier=|v_#StackHeapBarrier_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_258|, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_303|, #length=|v_#length_48|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_258|} OutVars{ULTIMATE.start_main_#t~mem45=|v_ULTIMATE.start_main_#t~mem45_34|, ULTIMATE.start_main_#t~mem46=|v_ULTIMATE.start_main_#t~mem46_52|, ULTIMATE.start_main_#t~mem43=|v_ULTIMATE.start_main_#t~mem43_33|, ULTIMATE.start_main_#t~mem44=|v_ULTIMATE.start_main_#t~mem44_31|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_257|, ULTIMATE.start_my_drv_probe_#res=|v_ULTIMATE.start_my_drv_probe_#res_20|, #NULL.offset=|v_#NULL.offset_5|, ~#t1~0.offset=|v_~#t1~0.offset_21|, ~#t1~0.base=|v_~#t1~0.base_21|, ULTIMATE.start_my_drv_probe_~data.base=v_ULTIMATE.start_my_drv_probe_~data.base_18, ULTIMATE.start_my_drv_init_#res=|v_ULTIMATE.start_my_drv_init_#res_16|, ~#t2~0.offset=|v_~#t2~0.offset_22|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_105|, #length=|v_#length_46|, ~#t2~0.base=|v_~#t2~0.base_22|, #pthreadsMutex=|v_#pthreadsMutex_157|, ULTIMATE.start_my_drv_probe_#in~data.base=|v_ULTIMATE.start_my_drv_probe_#in~data.base_15|, ULTIMATE.start_my_drv_probe_~d~0.offset=v_ULTIMATE.start_my_drv_probe_~d~0.offset_17, ULTIMATE.start_main_~ret~0=v_ULTIMATE.start_main_~ret~0_22, ULTIMATE.start_my_drv_probe_~data.offset=v_ULTIMATE.start_my_drv_probe_~data.offset_18, ULTIMATE.start_main_#t~ret41=|v_ULTIMATE.start_main_#t~ret41_29|, ULTIMATE.start_my_drv_probe_#in~data.offset=|v_ULTIMATE.start_my_drv_probe_#in~data.offset_15|, ULTIMATE.start_main_#t~ret42=|v_ULTIMATE.start_main_#t~ret42_31|, ULTIMATE.start_my_drv_probe_#t~nondet33=|v_ULTIMATE.start_my_drv_probe_#t~nondet33_12|, ULTIMATE.start_my_drv_probe_#t~nondet32=|v_ULTIMATE.start_my_drv_probe_#t~nondet32_25|, ULTIMATE.start_my_drv_probe_~res~0=v_ULTIMATE.start_my_drv_probe_~res~0_22, ULTIMATE.start_my_drv_probe_#t~nondet34=|v_ULTIMATE.start_my_drv_probe_#t~nondet34_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_my_drv_probe_~d~0.base=v_ULTIMATE.start_my_drv_probe_~d~0.base_17, #StackHeapBarrier=|v_#StackHeapBarrier_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_302|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_33, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_111|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_257|} AuxVars[v_DerPreprocessor_57, v_DerPreprocessor_58, v_DerPreprocessor_59, v_DerPreprocessor_60] AssignedVars[ULTIMATE.start_main_#t~mem45, ULTIMATE.start_main_#t~mem46, ULTIMATE.start_main_#t~mem43, ULTIMATE.start_main_#t~mem44, #memory_$Pointer$.base, ULTIMATE.start_my_drv_probe_#res, #NULL.offset, ~#t1~0.offset, ~#t1~0.base, ULTIMATE.start_my_drv_probe_~data.base, ULTIMATE.start_my_drv_init_#res, ~#t2~0.offset, ULTIMATE.start_main_~#data~1.offset, #length, ~#t2~0.base, #pthreadsMutex, ULTIMATE.start_my_drv_probe_#in~data.base, ULTIMATE.start_my_drv_probe_~d~0.offset, ULTIMATE.start_main_~ret~0, ULTIMATE.start_my_drv_probe_~data.offset, ULTIMATE.start_main_#t~ret41, ULTIMATE.start_my_drv_probe_#in~data.offset, ULTIMATE.start_main_#t~ret42, ULTIMATE.start_my_drv_probe_#t~nondet33, ULTIMATE.start_my_drv_probe_#t~nondet32, ULTIMATE.start_my_drv_probe_~res~0, ULTIMATE.start_my_drv_probe_#t~nondet34, #NULL.base, ULTIMATE.start_my_drv_probe_~d~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~probe_ret~0, ULTIMATE.start_main_~#data~1.base, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 18:59:21,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [512] [512] my_callbackENTRY-->L1700: Formula: (let ((.cse0 (select |v_#pthreadsMutex_138| v_my_callbackThread1of1ForFork0_~data~0.base_95))) (and (= (+ v_my_callbackThread1of1ForFork0_~__mptr~0.offset_10 (- 24)) v_my_callbackThread1of1ForFork0_~data~0.offset_95) (= v_my_callbackThread1of1ForFork0_~dev~0.base_11 v_my_callbackThread1of1ForFork0_~arg.base_10) (= v_my_callbackThread1of1ForFork0_~arg.offset_10 |v_my_callbackThread1of1ForFork0_#in~arg.offset_4|) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_95) 0) (= v_my_callbackThread1of1ForFork0_~dev~0.base_11 v_my_callbackThread1of1ForFork0_~__mptr~0.base_10) (= v_my_callbackThread1of1ForFork0_~arg.base_10 |v_my_callbackThread1of1ForFork0_#in~arg.base_4|) (= |v_#pthreadsMutex_137| (store |v_#pthreadsMutex_138| v_my_callbackThread1of1ForFork0_~data~0.base_95 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_95 1))) (= v_my_callbackThread1of1ForFork0_~data~0.base_95 v_my_callbackThread1of1ForFork0_~__mptr~0.base_10) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_11 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_10) (= v_my_callbackThread1of1ForFork0_~arg.offset_10 v_my_callbackThread1of1ForFork0_~dev~0.offset_11))) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_4|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_4|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_95, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_4|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_10, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_10, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_4|, my_callbackThread1of1ForFork0_#t~nondet30=|v_my_callbackThread1of1ForFork0_#t~nondet30_22|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_10, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_10, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_11, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_95, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_11} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_~arg.offset, my_callbackThread1of1ForFork0_#t~nondet30, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~dev~0.offset] because there is no mapped edge [2019-12-27 18:59:21,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [421] [421] L1713-2-->L1714-1: Formula: (and (= (store |v_#memory_$Pointer$.offset_73| |v_~#t2~0.base_6| (store (select |v_#memory_$Pointer$.offset_73| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6| (select (select |v_#memory_$Pointer$.offset_72| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6|))) |v_#memory_$Pointer$.offset_72|) (= (store |v_#memory_int_88| |v_~#t2~0.base_6| (store (select |v_#memory_int_88| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6| 1)) |v_#memory_int_87|) (= (store |v_#memory_$Pointer$.base_73| |v_~#t2~0.base_6| (store (select |v_#memory_$Pointer$.base_73| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6| (select (select |v_#memory_$Pointer$.base_72| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6|))) |v_#memory_$Pointer$.base_72|)) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_73|, ~#t2~0.offset=|v_~#t2~0.offset_6|, #memory_int=|v_#memory_int_88|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_73|, ~#t2~0.base=|v_~#t2~0.base_6|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_72|, ~#t2~0.offset=|v_~#t2~0.offset_6|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_my_drv_probe_#t~nondet33=|v_ULTIMATE.start_my_drv_probe_#t~nondet33_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_72|, ~#t2~0.base=|v_~#t2~0.base_6|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet33, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 18:59:21,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [422] [422] L1701-->L1702: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_38 28))) (and (= |v_#memory_$Pointer$.offset_78| (store |v_#memory_$Pointer$.offset_79| v_my_callbackThread1of1ForFork0_~data~0.base_38 (store (select |v_#memory_$Pointer$.offset_79| v_my_callbackThread1of1ForFork0_~data~0.base_38) .cse0 (select (select |v_#memory_$Pointer$.offset_78| v_my_callbackThread1of1ForFork0_~data~0.base_38) .cse0)))) (= |v_#memory_$Pointer$.base_78| (store |v_#memory_$Pointer$.base_79| v_my_callbackThread1of1ForFork0_~data~0.base_38 (store (select |v_#memory_$Pointer$.base_79| v_my_callbackThread1of1ForFork0_~data~0.base_38) .cse0 (select (select |v_#memory_$Pointer$.base_78| v_my_callbackThread1of1ForFork0_~data~0.base_38) .cse0)))) (= (store |v_#memory_int_94| v_my_callbackThread1of1ForFork0_~data~0.base_38 (store (select |v_#memory_int_94| v_my_callbackThread1of1ForFork0_~data~0.base_38) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem31_13| 1))) |v_#memory_int_93|))) InVars {my_callbackThread1of1ForFork0_#t~mem31=|v_my_callbackThread1of1ForFork0_#t~mem31_13|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_38, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_79|, #memory_int=|v_#memory_int_94|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_38, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_79|} OutVars{my_callbackThread1of1ForFork0_#t~mem31=|v_my_callbackThread1of1ForFork0_#t~mem31_12|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_38, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_78|, #memory_int=|v_#memory_int_93|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_38, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_78|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#t~mem31, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 18:59:21,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [435] [435] L1702-->my_callbackEXIT: Formula: (and (= (store |v_#pthreadsMutex_66| v_my_callbackThread1of1ForFork0_~data~0.base_59 (store (select |v_#pthreadsMutex_66| v_my_callbackThread1of1ForFork0_~data~0.base_59) v_my_callbackThread1of1ForFork0_~data~0.offset_59 0)) |v_#pthreadsMutex_65|) (= |v_my_callbackThread1of1ForFork0_#res.base_15| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_15| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_66|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_59, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_59} OutVars{#pthreadsMutex=|v_#pthreadsMutex_65|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_59, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_15|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_15|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_59} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 18:59:21,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [498] [498] my_callbackENTRY-->L1700: Formula: (let ((.cse0 (select |v_#pthreadsMutex_114| v_my_callbackThread1of1ForFork1_~data~0.base_63))) (and (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_9 v_my_callbackThread1of1ForFork1_~data~0.base_63) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_9 v_my_callbackThread1of1ForFork1_~dev~0.base_11) (= (+ v_my_callbackThread1of1ForFork1_~__mptr~0.offset_9 (- 24)) v_my_callbackThread1of1ForFork1_~data~0.offset_63) (= |v_my_callbackThread1of1ForFork1_#in~arg.base_5| v_my_callbackThread1of1ForFork1_~arg.base_7) (= (store |v_#pthreadsMutex_114| v_my_callbackThread1of1ForFork1_~data~0.base_63 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_63 1)) |v_#pthreadsMutex_113|) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_11 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_9) (= |v_my_callbackThread1of1ForFork1_#in~arg.offset_5| v_my_callbackThread1of1ForFork1_~arg.offset_7) (= v_my_callbackThread1of1ForFork1_~dev~0.base_11 v_my_callbackThread1of1ForFork1_~arg.base_7) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_11 v_my_callbackThread1of1ForFork1_~arg.offset_7) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_63) 0))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_5|, #pthreadsMutex=|v_#pthreadsMutex_114|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_5|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_5|, #pthreadsMutex=|v_#pthreadsMutex_113|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_63, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_63, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_7, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_7, my_callbackThread1of1ForFork1_#t~nondet30=|v_my_callbackThread1of1ForFork1_#t~nondet30_22|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_9, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_9, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_11, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_11, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_5|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_#t~nondet30, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_~dev~0.base] because there is no mapped edge [2019-12-27 18:59:21,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [474] [474] L1714-2-->L1741-4: Formula: (and (= |v_ULTIMATE.start_my_drv_probe_#res_11| |v_ULTIMATE.start_main_#t~ret42_15|) (= |v_ULTIMATE.start_main_#t~ret42_15| v_ULTIMATE.start_main_~probe_ret~0_15) (= |v_ULTIMATE.start_my_drv_probe_#res_11| 0)) InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res=|v_ULTIMATE.start_my_drv_probe_#res_11|, ULTIMATE.start_main_#t~ret42=|v_ULTIMATE.start_main_#t~ret42_15|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_15, ULTIMATE.start_my_drv_probe_#t~nondet34=|v_ULTIMATE.start_my_drv_probe_#t~nondet34_6|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res, ULTIMATE.start_main_#t~ret42, ULTIMATE.start_main_~probe_ret~0, ULTIMATE.start_my_drv_probe_#t~nondet34] because there is no mapped edge [2019-12-27 18:59:21,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [511] [511] L1741-4-->L1722: Formula: (and (= |v_#valid_58| (store |v_#valid_59| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_22| 1)) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_22| 4)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_22|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.base_8| v_ULTIMATE.start_my_drv_disconnect_~data.base_39) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.base_8| |v_ULTIMATE.start_main_~#data~1.base_95|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem35_14| (select (select |v_#memory_int_241| |v_~#t1~0.base_14|) |v_~#t1~0.offset_14|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_8| v_ULTIMATE.start_my_drv_disconnect_~data.offset_39) (= 0 (select |v_#valid_59| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_22|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_8| |v_ULTIMATE.start_main_~#data~1.offset_91|) (= 0 v_ULTIMATE.start_main_~probe_ret~0_24) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.offset_16| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_22| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, ~#t1~0.base=|v_~#t1~0.base_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_241|, ~#t1~0.offset=|v_~#t1~0.offset_14|, #length=|v_#length_30|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_91|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_24, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_95|} OutVars{ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_39, ULTIMATE.start_my_drv_disconnect_#t~mem38=|v_ULTIMATE.start_my_drv_disconnect_#t~mem38_20|, ULTIMATE.start_my_drv_disconnect_#t~mem37=|v_ULTIMATE.start_my_drv_disconnect_#t~mem37_25|, ULTIMATE.start_my_drv_disconnect_#in~data.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_8|, ULTIMATE.start_my_drv_disconnect_#t~mem39=|v_ULTIMATE.start_my_drv_disconnect_#t~mem39_17|, ULTIMATE.start_my_drv_disconnect_#t~mem35=|v_ULTIMATE.start_my_drv_disconnect_#t~mem35_14|, ULTIMATE.start_my_drv_disconnect_#t~nondet36.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet36.base_13|, ULTIMATE.start_main_#t~ret42=|v_ULTIMATE.start_main_#t~ret42_23|, ~#t1~0.offset=|v_~#t1~0.offset_14|, ULTIMATE.start_my_drv_disconnect_#t~nondet40.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet40.base_14|, ULTIMATE.start_my_drv_disconnect_#t~nondet40.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet40.offset_14|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.offset_16|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~#t1~0.base=|v_~#t1~0.base_14|, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_39, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_22|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_241|, #length=|v_#length_29|, ULTIMATE.start_my_drv_disconnect_#t~nondet36.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet36.offset_13|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_91|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_24, ULTIMATE.start_my_drv_disconnect_#in~data.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data.base_8|, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_95|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_~data.offset, ULTIMATE.start_my_drv_disconnect_#t~mem38, ULTIMATE.start_my_drv_disconnect_#t~mem37, ULTIMATE.start_my_drv_disconnect_#in~data.offset, ULTIMATE.start_my_drv_disconnect_#t~mem39, ULTIMATE.start_my_drv_disconnect_#t~mem35, ULTIMATE.start_my_drv_disconnect_#t~nondet36.base, ULTIMATE.start_main_#t~ret42, ULTIMATE.start_my_drv_disconnect_#t~nondet40.base, ULTIMATE.start_my_drv_disconnect_#t~nondet40.offset, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~data.base, ULTIMATE.start_my_drv_disconnect_~#status~0.base, #valid, #length, ULTIMATE.start_my_drv_disconnect_#t~nondet36.offset, ULTIMATE.start_my_drv_disconnect_#in~data.base] because there is no mapped edge [2019-12-27 18:59:21,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [458] [458] L1722-2-->L1723-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_my_drv_disconnect_~data.offset_25 24))) (and (= |v_#memory_$Pointer$.base_134| (store |v_#memory_$Pointer$.base_135| v_ULTIMATE.start_my_drv_disconnect_~data.base_25 (store (select |v_#memory_$Pointer$.base_135| v_ULTIMATE.start_my_drv_disconnect_~data.base_25) .cse0 (select (select |v_#memory_$Pointer$.base_134| v_ULTIMATE.start_my_drv_disconnect_~data.base_25) .cse0)))) (= (store |v_#memory_$Pointer$.offset_135| v_ULTIMATE.start_my_drv_disconnect_~data.base_25 (store (select |v_#memory_$Pointer$.offset_135| v_ULTIMATE.start_my_drv_disconnect_~data.base_25) .cse0 (select (select |v_#memory_$Pointer$.offset_134| v_ULTIMATE.start_my_drv_disconnect_~data.base_25) .cse0))) |v_#memory_$Pointer$.offset_134|) (= (store |v_#memory_int_155| v_ULTIMATE.start_my_drv_disconnect_~data.base_25 (store (select |v_#memory_int_155| v_ULTIMATE.start_my_drv_disconnect_~data.base_25) .cse0 3)) |v_#memory_int_154|))) InVars {ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_25, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_25, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_135|, #memory_int=|v_#memory_int_155|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_135|} OutVars{ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_25, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_25, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_134|, ULTIMATE.start_my_drv_disconnect_#t~mem35=|v_ULTIMATE.start_my_drv_disconnect_#t~mem35_10|, ULTIMATE.start_my_drv_disconnect_#t~nondet36.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet36.base_9|, #memory_int=|v_#memory_int_154|, ULTIMATE.start_my_drv_disconnect_#t~nondet36.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet36.offset_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_134|} AuxVars[] AssignedVars[#memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_#t~mem35, ULTIMATE.start_my_drv_disconnect_#t~nondet36.base, #memory_int, ULTIMATE.start_my_drv_disconnect_#t~nondet36.offset, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 18:59:21,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [481] [481] L1724-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start_ldv_assert_~expression_72 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem37_19| (select (select |v_#memory_int_171| v_ULTIMATE.start_my_drv_disconnect_~data.base_31) (+ v_ULTIMATE.start_my_drv_disconnect_~data.offset_31 24))) (= v_ULTIMATE.start_ldv_assert_~expression_72 |v_ULTIMATE.start_ldv_assert_#in~expression_47|) (not (= 3 |v_ULTIMATE.start_my_drv_disconnect_#t~mem37_19|))) InVars {ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_31, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_31, #memory_int=|v_#memory_int_171|} OutVars{ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_31, ULTIMATE.start_my_drv_disconnect_#t~mem37=|v_ULTIMATE.start_my_drv_disconnect_#t~mem37_19|, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_31, #memory_int=|v_#memory_int_171|, ULTIMATE.start_ldv_assert_#in~expression=|v_ULTIMATE.start_ldv_assert_#in~expression_47|, ULTIMATE.start_ldv_assert_~expression=v_ULTIMATE.start_ldv_assert_~expression_72} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem37, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2019-12-27 18:59:21,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:59:21 BasicIcfg [2019-12-27 18:59:21,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:59:21,928 INFO L168 Benchmark]: Toolchain (without parser) took 30965.57 ms. Allocated memory was 145.8 MB in the beginning and 321.9 MB in the end (delta: 176.2 MB). Free memory was 99.5 MB in the beginning and 215.4 MB in the end (delta: -116.0 MB). Peak memory consumption was 60.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:59:21,928 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:59:21,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1380.06 ms. Allocated memory was 145.8 MB in the beginning and 238.6 MB in the end (delta: 92.8 MB). Free memory was 99.3 MB in the beginning and 170.9 MB in the end (delta: -71.6 MB). Peak memory consumption was 73.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:59:21,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.96 ms. Allocated memory is still 238.6 MB. Free memory was 170.9 MB in the beginning and 167.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:59:21,931 INFO L168 Benchmark]: Boogie Preprocessor took 61.13 ms. Allocated memory is still 238.6 MB. Free memory was 167.9 MB in the beginning and 165.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:59:21,931 INFO L168 Benchmark]: RCFGBuilder took 826.49 ms. Allocated memory is still 238.6 MB. Free memory was 165.0 MB in the beginning and 116.4 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:59:21,932 INFO L168 Benchmark]: TraceAbstraction took 28610.05 ms. Allocated memory was 238.6 MB in the beginning and 321.9 MB in the end (delta: 83.4 MB). Free memory was 116.4 MB in the beginning and 215.4 MB in the end (delta: -99.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 18:59:21,942 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.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1380.06 ms. Allocated memory was 145.8 MB in the beginning and 238.6 MB in the end (delta: 92.8 MB). Free memory was 99.3 MB in the beginning and 170.9 MB in the end (delta: -71.6 MB). Peak memory consumption was 73.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.96 ms. Allocated memory is still 238.6 MB. Free memory was 170.9 MB in the beginning and 167.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.13 ms. Allocated memory is still 238.6 MB. Free memory was 167.9 MB in the beginning and 165.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 826.49 ms. Allocated memory is still 238.6 MB. Free memory was 165.0 MB in the beginning and 116.4 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28610.05 ms. Allocated memory was 238.6 MB in the beginning and 321.9 MB in the end (delta: 83.4 MB). Free memory was 116.4 MB in the beginning and 215.4 MB in the end (delta: -99.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 26.2s, 153 ProgramPointsBefore, 45 ProgramPointsAfterwards, 157 TransitionsBefore, 45 TransitionsAfterwards, 4004 CoEnabledTransitionPairs, 8 FixpointIterations, 66 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 20 ConcurrentYvCompositions, 5 ChoiceCompositions, 2208 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 7 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 7 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 16.2s, 0 MoverChecksTotal, 8278 CheckedPairsTotal, 160 TotalNumberOfCompositions - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={7:24}, t1={6:0}, t2={5:0}] [L1700] 1 data->shared.a = 1 VAL [__mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={6:0}, t2={5:0}] [L1701] 1 data->shared.b VAL [__mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, data->shared.b=0, dev={7:24}, t1={6:0}, t2={5:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={6:0}, t2={5:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={6:0}, t2={5:0}] [L1700] 2 data->shared.a = 1 VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={6:0}, t2={5:0}] [L1724] 0 data->shared.b = 3 VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1={6:0}, t2={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 132 locations, 6 error locations. Result: UNSAFE, OverallTime: 28.4s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 200 SDtfs, 111 SDslu, 135 SDs, 0 SdLazy, 194 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=554occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 234 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 1470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...