/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-McrStrategy.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 11:34:02,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 11:34:02,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 11:34:02,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 11:34:02,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 11:34:02,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 11:34:02,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 11:34:02,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 11:34:02,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 11:34:02,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 11:34:02,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 11:34:02,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 11:34:02,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 11:34:02,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 11:34:02,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 11:34:02,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 11:34:02,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 11:34:02,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 11:34:02,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 11:34:02,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 11:34:02,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 11:34:02,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 11:34:02,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 11:34:02,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 11:34:02,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 11:34:02,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 11:34:02,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 11:34:02,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 11:34:02,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 11:34:02,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 11:34:02,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 11:34:02,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 11:34:02,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 11:34:02,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 11:34:02,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 11:34:02,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 11:34:02,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 11:34:02,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 11:34:02,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 11:34:02,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 11:34:02,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 11:34:02,677 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-McrStrategy.epf [2020-04-18 11:34:02,700 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 11:34:02,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 11:34:02,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 11:34:02,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 11:34:02,703 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 11:34:02,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 11:34:02,703 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 11:34:02,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 11:34:02,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 11:34:02,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 11:34:02,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 11:34:02,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 11:34:02,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 11:34:02,706 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 11:34:02,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 11:34:02,706 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 11:34:02,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 11:34:02,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 11:34:02,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 11:34:02,707 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 11:34:02,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 11:34:02,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 11:34:02,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 11:34:02,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 11:34:02,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 11:34:02,708 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 11:34:02,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 11:34:02,709 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 11:34:02,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 11:34:02,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 11:34:03,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 11:34:03,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 11:34:03,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 11:34:03,027 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 11:34:03,028 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 11:34:03,029 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-04-18 11:34:03,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3525fbe/bf0dfa73b012470cb1c02a4b75dadd5b/FLAG3e7887460 [2020-04-18 11:34:03,779 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 11:34:03,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-04-18 11:34:03,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3525fbe/bf0dfa73b012470cb1c02a4b75dadd5b/FLAG3e7887460 [2020-04-18 11:34:04,017 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3525fbe/bf0dfa73b012470cb1c02a4b75dadd5b [2020-04-18 11:34:04,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 11:34:04,049 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 11:34:04,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 11:34:04,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 11:34:04,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 11:34:04,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 11:34:04" (1/1) ... [2020-04-18 11:34:04,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7911a30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:04, skipping insertion in model container [2020-04-18 11:34:04,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 11:34:04" (1/1) ... [2020-04-18 11:34:04,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 11:34:04,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 11:34:04,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 11:34:04,966 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 11:34:05,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 11:34:05,620 INFO L208 MainTranslator]: Completed translation [2020-04-18 11:34:05,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:05 WrapperNode [2020-04-18 11:34:05,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 11:34:05,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 11:34:05,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 11:34:05,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 11:34:05,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:05" (1/1) ... [2020-04-18 11:34:05,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:05" (1/1) ... [2020-04-18 11:34:05,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 11:34:05,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 11:34:05,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 11:34:05,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 11:34:05,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:05" (1/1) ... [2020-04-18 11:34:05,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:05" (1/1) ... [2020-04-18 11:34:05,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:05" (1/1) ... [2020-04-18 11:34:05,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:05" (1/1) ... [2020-04-18 11:34:05,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:05" (1/1) ... [2020-04-18 11:34:05,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:05" (1/1) ... [2020-04-18 11:34:05,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:05" (1/1) ... [2020-04-18 11:34:05,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 11:34:05,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 11:34:05,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 11:34:05,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 11:34:05,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 11:34:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 11:34:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-18 11:34:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-04-18 11:34:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 11:34:05,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 11:34:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-04-18 11:34:05,869 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-04-18 11:34:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 11:34:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 11:34:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-04-18 11:34:05,873 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 11:34:06,773 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 11:34:06,774 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-04-18 11:34:06,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 11:34:06 BoogieIcfgContainer [2020-04-18 11:34:06,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 11:34:06,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 11:34:06,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 11:34:06,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 11:34:06,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 11:34:04" (1/3) ... [2020-04-18 11:34:06,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce3a6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 11:34:06, skipping insertion in model container [2020-04-18 11:34:06,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:34:05" (2/3) ... [2020-04-18 11:34:06,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce3a6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 11:34:06, skipping insertion in model container [2020-04-18 11:34:06,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 11:34:06" (3/3) ... [2020-04-18 11:34:06,787 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-04-18 11:34:06,798 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 11:34:06,799 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 11:34:06,806 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-04-18 11:34:06,807 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 11:34:06,839 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,839 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,840 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,840 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,840 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,840 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,841 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,841 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,841 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,841 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,842 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,842 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,842 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,842 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,843 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,843 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,843 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,843 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,843 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,844 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,844 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,844 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,845 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,845 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,845 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,845 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,846 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,846 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,846 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,847 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,847 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,847 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,847 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,847 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,848 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,848 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,848 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,849 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,849 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,849 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,849 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,849 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,850 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,850 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,850 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,850 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,854 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,855 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,855 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,855 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,856 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,856 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,856 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,856 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,857 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,863 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,864 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,864 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,864 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,864 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,865 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,865 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,865 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,865 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:34:06,903 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-04-18 11:34:06,921 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:34:06,922 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:34:06,922 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:34:06,922 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:34:06,922 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:34:06,922 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:34:06,923 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:34:06,923 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:34:06,940 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions, 318 flow [2020-04-18 11:34:06,942 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-04-18 11:34:07,013 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-04-18 11:34:07,014 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-18 11:34:07,024 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-04-18 11:34:07,033 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-04-18 11:34:07,123 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-04-18 11:34:07,123 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-18 11:34:07,124 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-04-18 11:34:07,127 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1980 [2020-04-18 11:34:07,128 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 11:34:07,626 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:07,667 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:07,674 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:07,709 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:07,711 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:07,711 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-04-18 11:34:07,731 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:07,767 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:07,773 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:07,807 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:07,808 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:07,809 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-04-18 11:34:10,804 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:10,834 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:10,839 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:10,864 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:10,865 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:10,865 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-04-18 11:34:11,542 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:11,581 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:11,591 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:11,627 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:11,629 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:11,629 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-04-18 11:34:11,657 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:11,698 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:11,702 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:11,733 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:11,735 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:11,735 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-04-18 11:34:13,753 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:13,784 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:13,800 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:13,842 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:13,843 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:13,844 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-04-18 11:34:13,858 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:13,893 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:13,898 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:13,932 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:13,933 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:13,933 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-04-18 11:34:15,949 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:15,981 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:15,986 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:16,015 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:16,017 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:16,017 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-04-18 11:34:16,035 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:16,066 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:16,073 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:16,100 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:16,101 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:16,102 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-04-18 11:34:20,080 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:20,106 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:20,111 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:20,135 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:20,136 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:20,136 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-04-18 11:34:21,009 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-04-18 11:34:21,330 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2020-04-18 11:34:21,796 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:21,835 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:21,840 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:21,870 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:21,871 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:21,871 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-04-18 11:34:21,915 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:21,981 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:21,986 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:22,037 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:22,038 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:22,038 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-04-18 11:34:22,057 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:22,112 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:22,116 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:22,172 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:22,173 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:22,173 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:129 [2020-04-18 11:34:24,188 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:24,230 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:24,235 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:24,275 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:24,276 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:24,276 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-04-18 11:34:24,292 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:24,343 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:24,348 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:24,388 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:24,389 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:24,389 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-04-18 11:34:27,531 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-04-18 11:34:27,655 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-04-18 11:34:28,083 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-04-18 11:34:28,756 WARN L192 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2020-04-18 11:34:28,997 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-04-18 11:34:29,779 WARN L192 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-04-18 11:34:30,037 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-04-18 11:34:31,405 WARN L192 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-04-18 11:34:31,419 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:31,952 WARN L192 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-04-18 11:34:31,953 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:31,960 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:34:32,456 WARN L192 SmtUtils]: Spent 495.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-04-18 11:34:32,457 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:34:32,458 INFO L539 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. [2020-04-18 11:34:32,458 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-04-18 11:34:32,898 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-04-18 11:34:32,908 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2994 [2020-04-18 11:34:32,909 INFO L214 etLargeBlockEncoding]: Total number of compositions: 159 [2020-04-18 11:34:32,912 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 34 transitions, 90 flow [2020-04-18 11:34:32,931 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 192 states. [2020-04-18 11:34:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-04-18 11:34:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-18 11:34:32,939 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:34:32,940 INFO L425 BasicCegarLoop]: trace histogram [1] [2020-04-18 11:34:32,940 INFO L427 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]=== [2020-04-18 11:34:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:32,946 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2020-04-18 11:34:32,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:34:32,954 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1016856444] [2020-04-18 11:34:32,969 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:32,977 INFO L259 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-04-18 11:34:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2 states. [2020-04-18 11:34:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-18 11:34:32,979 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:34:32,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:32,980 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 2 times [2020-04-18 11:34:32,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:32,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598086999] [2020-04-18 11:34:32,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:33,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598086999] [2020-04-18 11:34:33,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:33,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-04-18 11:34:33,255 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:33,256 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:33,256 INFO L259 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-04-18 11:34:33,256 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:33,265 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:34:33,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 11:34:33,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 11:34:33,273 INFO L87 Difference]: Start difference. First operand 2 states. Second operand 2 states. [2020-04-18 11:34:33,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:33,279 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2020-04-18 11:34:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2 states and 1 transitions. [2020-04-18 11:34:33,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:34:33,280 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1016856444] [2020-04-18 11:34:33,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:34:33,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [0] total 0 [2020-04-18 11:34:33,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1016856444] [2020-04-18 11:34:33,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-04-18 11:34:33,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:34:33,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 11:34:33,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 11:34:33,288 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2020-04-18 11:34:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:33,303 INFO L93 Difference]: Finished difference Result 190 states and 416 transitions. [2020-04-18 11:34:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-04-18 11:34:33,305 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-04-18 11:34:33,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:34:33,316 INFO L225 Difference]: With dead ends: 190 [2020-04-18 11:34:33,316 INFO L226 Difference]: Without dead ends: 172 [2020-04-18 11:34:33,318 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 11:34:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-04-18 11:34:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-04-18 11:34:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-04-18 11:34:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2020-04-18 11:34:33,399 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2020-04-18 11:34:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:34:33,399 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2020-04-18 11:34:33,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-04-18 11:34:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2020-04-18 11:34:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-04-18 11:34:33,400 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:34:33,400 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-04-18 11:34:33,401 INFO L427 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]=== [2020-04-18 11:34:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:33,401 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2020-04-18 11:34:33,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:34:33,402 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1923201187] [2020-04-18 11:34:33,402 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:33,402 INFO L259 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-04-18 11:34:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-04-18 11:34:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-04-18 11:34:33,403 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:34:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 2 times [2020-04-18 11:34:33,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:33,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448937422] [2020-04-18 11:34:33,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:33,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448937422] [2020-04-18 11:34:33,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:33,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:34:33,613 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:33,614 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:33,615 INFO L259 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-04-18 11:34:33,615 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:33,624 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:34:33,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:34:33,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:34:33,625 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2020-04-18 11:34:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:33,635 INFO L93 Difference]: Finished difference Result 5 states and 4 transitions. [2020-04-18 11:34:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 4 transitions. [2020-04-18 11:34:33,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:34:33,636 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1923201187] [2020-04-18 11:34:33,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:34:33,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 11:34:33,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1923201187] [2020-04-18 11:34:33,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:34:33,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:34:33,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:34:33,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:34:33,638 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2020-04-18 11:34:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:33,784 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2020-04-18 11:34:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:34:33,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-04-18 11:34:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:34:33,789 INFO L225 Difference]: With dead ends: 230 [2020-04-18 11:34:33,789 INFO L226 Difference]: Without dead ends: 230 [2020-04-18 11:34:33,790 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:34:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-04-18 11:34:33,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-04-18 11:34:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-04-18 11:34:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-04-18 11:34:33,819 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-04-18 11:34:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:34:33,819 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-04-18 11:34:33,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:34:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-04-18 11:34:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 11:34:33,820 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:34:33,820 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 11:34:33,820 INFO L427 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]=== [2020-04-18 11:34:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:33,821 INFO L82 PathProgramCache]: Analyzing trace with hash 514428411, now seen corresponding path program 1 times [2020-04-18 11:34:33,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:34:33,821 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1723468755] [2020-04-18 11:34:33,822 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:33,822 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 11:34:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 11:34:33,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 11:34:33,822 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:34:33,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash 514428411, now seen corresponding path program 2 times [2020-04-18 11:34:33,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:33,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133713840] [2020-04-18 11:34:33,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:33,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133713840] [2020-04-18 11:34:33,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:33,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:34:33,916 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:33,917 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:33,918 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 11:34:33,918 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:33,925 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:34:33,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:34:33,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:34:33,926 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 11:34:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:33,939 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 11:34:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 11:34:33,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:34:33,939 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1723468755] [2020-04-18 11:34:33,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:34:33,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 11:34:33,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1723468755] [2020-04-18 11:34:33,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:34:33,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:34:33,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:34:33,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:34:33,941 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-04-18 11:34:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:34,064 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-04-18 11:34:34,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:34:34,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 11:34:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:34:34,068 INFO L225 Difference]: With dead ends: 243 [2020-04-18 11:34:34,068 INFO L226 Difference]: Without dead ends: 236 [2020-04-18 11:34:34,068 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:34:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-04-18 11:34:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-04-18 11:34:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-04-18 11:34:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-04-18 11:34:34,084 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-04-18 11:34:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:34:34,085 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-04-18 11:34:34,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:34:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-04-18 11:34:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 11:34:34,086 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:34:34,086 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:34:34,087 INFO L427 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]=== [2020-04-18 11:34:34,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:34,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1038453307, now seen corresponding path program 1 times [2020-04-18 11:34:34,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:34:34,088 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1377377313] [2020-04-18 11:34:34,088 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:34,089 INFO L259 McrAutomatonBuilder]: Finished intersection with 16 states and 21 transitions. [2020-04-18 11:34:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-04-18 11:34:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 11:34:34,090 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:34:34,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:34,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1918524495, now seen corresponding path program 2 times [2020-04-18 11:34:34,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:34,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406312483] [2020-04-18 11:34:34,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:34,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406312483] [2020-04-18 11:34:34,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:34,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:34:34,168 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:34,169 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:34,170 INFO L259 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-04-18 11:34:34,171 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:34,179 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:34:34,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:34:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:34:34,180 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2020-04-18 11:34:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:34,193 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-04-18 11:34:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-04-18 11:34:34,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:34:34,194 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1377377313] [2020-04-18 11:34:34,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:34:34,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:34:34,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1377377313] [2020-04-18 11:34:34,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:34:34,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:34:34,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:34:34,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:34:34,195 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-04-18 11:34:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:34,216 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-04-18 11:34:34,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:34:34,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-04-18 11:34:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:34:34,217 INFO L225 Difference]: With dead ends: 86 [2020-04-18 11:34:34,218 INFO L226 Difference]: Without dead ends: 86 [2020-04-18 11:34:34,218 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:34:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-04-18 11:34:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-04-18 11:34:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-04-18 11:34:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-04-18 11:34:34,223 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-04-18 11:34:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:34:34,224 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-04-18 11:34:34,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:34:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-04-18 11:34:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:34,225 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:34:34,225 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:34:34,226 INFO L427 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]=== [2020-04-18 11:34:34,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash 82727147, now seen corresponding path program 1 times [2020-04-18 11:34:34,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:34:34,226 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1950610601] [2020-04-18 11:34:34,227 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:34,229 INFO L259 McrAutomatonBuilder]: Finished intersection with 73 states and 144 transitions. [2020-04-18 11:34:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2020-04-18 11:34:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:34,231 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:34:34,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:34,232 INFO L82 PathProgramCache]: Analyzing trace with hash 82727147, now seen corresponding path program 2 times [2020-04-18 11:34:34,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:34,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379646466] [2020-04-18 11:34:34,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:34,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379646466] [2020-04-18 11:34:34,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:34,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:34:34,736 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:34,742 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:34,751 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 11:34:34,752 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:35,006 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:34:35,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:34:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:34:35,007 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 9 states. [2020-04-18 11:34:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:35,821 INFO L93 Difference]: Finished difference Result 115 states and 211 transitions. [2020-04-18 11:34:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 211 transitions. [2020-04-18 11:34:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:35,823 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:34:35,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:35,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555757, now seen corresponding path program 3 times [2020-04-18 11:34:35,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:35,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96455740] [2020-04-18 11:34:35,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:36,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96455740] [2020-04-18 11:34:36,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:36,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:34:36,260 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:36,265 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:36,274 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 11:34:36,275 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:36,380 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:34:36,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:34:36,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:34:36,381 INFO L87 Difference]: Start difference. First operand 115 states and 211 transitions. Second operand 7 states. [2020-04-18 11:34:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:36,800 INFO L93 Difference]: Finished difference Result 139 states and 242 transitions. [2020-04-18 11:34:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 242 transitions. [2020-04-18 11:34:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:36,801 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:34:36,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:36,802 INFO L82 PathProgramCache]: Analyzing trace with hash 311067317, now seen corresponding path program 4 times [2020-04-18 11:34:36,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:36,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884288324] [2020-04-18 11:34:36,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:37,311 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2020-04-18 11:34:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:37,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884288324] [2020-04-18 11:34:37,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:37,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:34:37,501 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:37,503 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:37,508 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:34:37,508 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:37,697 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:34:37,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:34:37,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2020-04-18 11:34:37,699 INFO L87 Difference]: Start difference. First operand 139 states and 242 transitions. Second operand 9 states. [2020-04-18 11:34:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:38,641 INFO L93 Difference]: Finished difference Result 209 states and 332 transitions. [2020-04-18 11:34:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 332 transitions. [2020-04-18 11:34:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:38,642 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:34:38,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:38,643 INFO L82 PathProgramCache]: Analyzing trace with hash -11903171, now seen corresponding path program 5 times [2020-04-18 11:34:38,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:38,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992075794] [2020-04-18 11:34:38,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:39,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992075794] [2020-04-18 11:34:39,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:39,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:34:39,211 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:39,213 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:39,220 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 26 transitions. [2020-04-18 11:34:39,221 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:39,350 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:34:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:34:39,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2020-04-18 11:34:39,351 INFO L87 Difference]: Start difference. First operand 209 states and 332 transitions. Second operand 9 states. [2020-04-18 11:34:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:40,151 INFO L93 Difference]: Finished difference Result 260 states and 424 transitions. [2020-04-18 11:34:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 424 transitions. [2020-04-18 11:34:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:40,152 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:34:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:40,153 INFO L82 PathProgramCache]: Analyzing trace with hash 182574325, now seen corresponding path program 6 times [2020-04-18 11:34:40,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:40,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734532970] [2020-04-18 11:34:40,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:40,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734532970] [2020-04-18 11:34:40,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:40,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:34:40,833 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:40,835 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:40,839 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:34:40,839 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:40,840 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:34:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:34:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2020-04-18 11:34:40,840 INFO L87 Difference]: Start difference. First operand 260 states and 424 transitions. Second operand 9 states. [2020-04-18 11:34:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:41,613 INFO L93 Difference]: Finished difference Result 293 states and 468 transitions. [2020-04-18 11:34:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 468 transitions. [2020-04-18 11:34:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:41,614 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:34:41,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:41,614 INFO L82 PathProgramCache]: Analyzing trace with hash -109048313, now seen corresponding path program 7 times [2020-04-18 11:34:41,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:41,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886870747] [2020-04-18 11:34:41,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:42,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886870747] [2020-04-18 11:34:42,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:42,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:34:42,147 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:42,150 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:42,155 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:34:42,155 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:42,360 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:34:42,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:34:42,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2020-04-18 11:34:42,361 INFO L87 Difference]: Start difference. First operand 293 states and 468 transitions. Second operand 9 states. [2020-04-18 11:34:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:43,525 INFO L93 Difference]: Finished difference Result 299 states and 474 transitions. [2020-04-18 11:34:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 474 transitions. [2020-04-18 11:34:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:43,526 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 11:34:43,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:43,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1649493417, now seen corresponding path program 8 times [2020-04-18 11:34:43,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:43,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069014626] [2020-04-18 11:34:43,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:43,942 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2020-04-18 11:34:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:44,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069014626] [2020-04-18 11:34:44,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:44,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:34:44,222 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:44,227 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:44,233 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 30 transitions. [2020-04-18 11:34:44,233 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:44,444 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:34:44,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:34:44,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2020-04-18 11:34:44,446 INFO L87 Difference]: Start difference. First operand 299 states and 474 transitions. Second operand 9 states. [2020-04-18 11:34:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:45,287 INFO L93 Difference]: Finished difference Result 300 states and 474 transitions. [2020-04-18 11:34:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 474 transitions. [2020-04-18 11:34:45,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:34:45,289 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1950610601] [2020-04-18 11:34:45,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:34:45,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 11:34:45,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1950610601] [2020-04-18 11:34:45,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-04-18 11:34:45,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:34:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-04-18 11:34:45,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1248, Unknown=0, NotChecked=0, Total=1560 [2020-04-18 11:34:45,291 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 23 states. [2020-04-18 11:34:45,838 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2020-04-18 11:34:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:46,549 INFO L93 Difference]: Finished difference Result 85 states and 166 transitions. [2020-04-18 11:34:46,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-04-18 11:34:46,550 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 18 [2020-04-18 11:34:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:34:46,551 INFO L225 Difference]: With dead ends: 85 [2020-04-18 11:34:46,551 INFO L226 Difference]: Without dead ends: 85 [2020-04-18 11:34:46,552 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 123 SyntacticMatches, 13 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=372, Invalid=1350, Unknown=0, NotChecked=0, Total=1722 [2020-04-18 11:34:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-04-18 11:34:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-04-18 11:34:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-04-18 11:34:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 166 transitions. [2020-04-18 11:34:46,556 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 166 transitions. Word has length 18 [2020-04-18 11:34:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:34:46,557 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 166 transitions. [2020-04-18 11:34:46,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-04-18 11:34:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 166 transitions. [2020-04-18 11:34:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:46,558 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:34:46,558 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:34:46,558 INFO L427 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]=== [2020-04-18 11:34:46,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:46,558 INFO L82 PathProgramCache]: Analyzing trace with hash 82727169, now seen corresponding path program 1 times [2020-04-18 11:34:46,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:34:46,559 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [624593889] [2020-04-18 11:34:46,560 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:46,561 INFO L259 McrAutomatonBuilder]: Finished intersection with 73 states and 144 transitions. [2020-04-18 11:34:46,561 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2020-04-18 11:34:46,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:46,562 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:34:46,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:46,562 INFO L82 PathProgramCache]: Analyzing trace with hash 82727169, now seen corresponding path program 2 times [2020-04-18 11:34:46,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:46,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005825488] [2020-04-18 11:34:46,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:47,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005825488] [2020-04-18 11:34:47,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:47,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 11:34:47,554 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:47,556 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:47,561 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 11:34:47,561 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:48,095 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:34:48,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 11:34:48,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:34:48,096 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 15 states. [2020-04-18 11:34:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:50,269 INFO L93 Difference]: Finished difference Result 114 states and 200 transitions. [2020-04-18 11:34:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 200 transitions. [2020-04-18 11:34:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:50,269 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:34:50,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:50,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555779, now seen corresponding path program 3 times [2020-04-18 11:34:50,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:50,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367715541] [2020-04-18 11:34:50,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:50,568 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2020-04-18 11:34:50,685 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2020-04-18 11:34:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:51,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367715541] [2020-04-18 11:34:51,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:51,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 11:34:51,206 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:51,208 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:51,213 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 11:34:51,213 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:51,387 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:34:51,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:34:51,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2020-04-18 11:34:51,388 INFO L87 Difference]: Start difference. First operand 114 states and 200 transitions. Second operand 12 states. [2020-04-18 11:34:52,273 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-04-18 11:34:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:53,022 INFO L93 Difference]: Finished difference Result 149 states and 249 transitions. [2020-04-18 11:34:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 249 transitions. [2020-04-18 11:34:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:53,023 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:34:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:53,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1342972915, now seen corresponding path program 4 times [2020-04-18 11:34:53,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:53,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269065386] [2020-04-18 11:34:53,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:53,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269065386] [2020-04-18 11:34:53,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:53,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 11:34:53,918 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:53,920 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:53,925 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 11:34:53,925 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:53,949 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:34:53,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:34:53,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2020-04-18 11:34:53,950 INFO L87 Difference]: Start difference. First operand 149 states and 249 transitions. Second operand 13 states. [2020-04-18 11:34:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:55,637 INFO L93 Difference]: Finished difference Result 163 states and 264 transitions. [2020-04-18 11:34:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 264 transitions. [2020-04-18 11:34:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:55,638 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:34:55,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:55,639 INFO L82 PathProgramCache]: Analyzing trace with hash -285831053, now seen corresponding path program 5 times [2020-04-18 11:34:55,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:55,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154044576] [2020-04-18 11:34:55,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:34:56,014 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2020-04-18 11:34:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:34:56,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154044576] [2020-04-18 11:34:56,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:34:56,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 11:34:56,600 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:34:56,602 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:34:56,608 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 11:34:56,608 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:34:56,946 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:34:56,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 11:34:56,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2020-04-18 11:34:56,947 INFO L87 Difference]: Start difference. First operand 163 states and 264 transitions. Second operand 14 states. [2020-04-18 11:34:58,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:34:58,512 INFO L93 Difference]: Finished difference Result 214 states and 348 transitions. [2020-04-18 11:34:58,513 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 348 transitions. [2020-04-18 11:34:58,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:34:58,514 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:34:58,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:34:58,514 INFO L82 PathProgramCache]: Analyzing trace with hash 311067339, now seen corresponding path program 6 times [2020-04-18 11:34:58,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:34:58,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134000591] [2020-04-18 11:34:58,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:34:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:34:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:34:58,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 11:34:58,609 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 11:34:58,609 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 11:34:58,610 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 11:34:58,610 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 11:34:58,611 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 11:34:58,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L1706-->L1708-2: Formula: (let ((.cse1 (select |#memory_int_In2017370748| ULTIMATE.start_my_drv_probe_~data.base_In2017370748))) (and (let ((.cse0 (= 0 |ULTIMATE.start_my_drv_probe_#t~mem32_Out2017370748|))) (or (and (= 1 |ULTIMATE.start_ldv_assert_#in~expression_Out2017370748|) .cse0) (and (= 0 |ULTIMATE.start_ldv_assert_#in~expression_Out2017370748|) (not .cse0)))) (= ULTIMATE.start_ldv_assert_~expression_Out2017370748 1) (= (select .cse1 (+ ULTIMATE.start_my_drv_probe_~data.offset_In2017370748 28)) |ULTIMATE.start_my_drv_probe_#t~mem32_Out2017370748|) (= 0 (select .cse1 (+ ULTIMATE.start_my_drv_probe_~data.offset_In2017370748 24))))) InVars {ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In2017370748, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In2017370748, #memory_int=|#memory_int_In2017370748|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem31=|ULTIMATE.start_my_drv_probe_#t~mem31_Out2017370748|, ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out2017370748|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In2017370748, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In2017370748, #memory_int=|#memory_int_In2017370748|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out2017370748|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out2017370748} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem31, ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-04-18 11:34:58,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L1708-2-->L1709-1: Formula: (and (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet33_In577462745| 2147483648)) (<= |ULTIMATE.start_my_drv_probe_#t~nondet33_In577462745| 2147483647) (not (= ULTIMATE.start_ldv_assert_~expression_Out577462745 0)) (= ULTIMATE.start_ldv_assert_~expression_Out577462745 |ULTIMATE.start_ldv_assert_#in~expression_In577462745|)) InVars {ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In577462745|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In577462745|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out577462745|, ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In577462745|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In577462745|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out577462745} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-04-18 11:34:58,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [498] [498] L1721-3-->L1741-2: Formula: (let ((.cse0 (select |#memory_int_In1799195402| |ULTIMATE.start_main_~#data~1.base_In1799195402|))) (and (= (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In1799195402| 28)) |ULTIMATE.start_main_#t~mem43_Out1799195402|) (= ULTIMATE.start_ldv_assert_~expression_Out1799195402 1) (= 1 (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In1799195402| 24))) (let ((.cse1 (= 2 |ULTIMATE.start_main_#t~mem43_Out1799195402|))) (or (and .cse1 (= |ULTIMATE.start_ldv_assert_#in~expression_Out1799195402| 1)) (and (not .cse1) (= |ULTIMATE.start_ldv_assert_#in~expression_Out1799195402| 0)))))) InVars {#memory_int=|#memory_int_In1799195402|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In1799195402|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In1799195402|} OutVars{ULTIMATE.start_main_#t~mem43=|ULTIMATE.start_main_#t~mem43_Out1799195402|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|ULTIMATE.start_my_drv_disconnect_~#status~0.offset_Out1799195402|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_Out1799195402|, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out1799195402|, #memory_int=|#memory_int_In1799195402|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In1799195402|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out1799195402|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In1799195402|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out1799195402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem43, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~#status~0.base, ULTIMATE.start_main_#t~mem42, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-04-18 11:34:58,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 11:34:58 BasicIcfg [2020-04-18 11:34:58,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 11:34:58,696 INFO L168 Benchmark]: Toolchain (without parser) took 54665.93 ms. Allocated memory was 138.9 MB in the beginning and 411.0 MB in the end (delta: 272.1 MB). Free memory was 100.0 MB in the beginning and 116.8 MB in the end (delta: -16.7 MB). Peak memory consumption was 255.4 MB. Max. memory is 7.1 GB. [2020-04-18 11:34:58,696 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-04-18 11:34:58,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1568.78 ms. Allocated memory was 138.9 MB in the beginning and 238.0 MB in the end (delta: 99.1 MB). Free memory was 98.1 MB in the beginning and 171.2 MB in the end (delta: -73.1 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. [2020-04-18 11:34:58,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.97 ms. Allocated memory is still 238.0 MB. Free memory was 171.2 MB in the beginning and 167.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-04-18 11:34:58,701 INFO L168 Benchmark]: Boogie Preprocessor took 87.66 ms. Allocated memory is still 238.0 MB. Free memory was 167.7 MB in the beginning and 165.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2020-04-18 11:34:58,701 INFO L168 Benchmark]: RCFGBuilder took 991.48 ms. Allocated memory is still 238.0 MB. Free memory was 164.2 MB in the beginning and 117.4 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2020-04-18 11:34:58,702 INFO L168 Benchmark]: TraceAbstraction took 51911.56 ms. Allocated memory was 238.0 MB in the beginning and 411.0 MB in the end (delta: 173.0 MB). Free memory was 117.4 MB in the beginning and 116.8 MB in the end (delta: 585.0 kB). Peak memory consumption was 173.6 MB. Max. memory is 7.1 GB. [2020-04-18 11:34:58,711 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1568.78 ms. Allocated memory was 138.9 MB in the beginning and 238.0 MB in the end (delta: 99.1 MB). Free memory was 98.1 MB in the beginning and 171.2 MB in the end (delta: -73.1 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.97 ms. Allocated memory is still 238.0 MB. Free memory was 171.2 MB in the beginning and 167.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 87.66 ms. Allocated memory is still 238.0 MB. Free memory was 167.7 MB in the beginning and 165.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 991.48 ms. Allocated memory is still 238.0 MB. Free memory was 164.2 MB in the beginning and 117.4 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51911.56 ms. Allocated memory was 238.0 MB in the beginning and 411.0 MB in the end (delta: 173.0 MB). Free memory was 117.4 MB in the beginning and 116.8 MB in the end (delta: 585.0 kB). Peak memory consumption was 173.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 25.9s, 144 ProgramPointsBefore, 36 ProgramPointsAfterwards, 148 TransitionsBefore, 34 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 8 FixpointIterations, 86 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 996 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 36 SemBasedMoverChecksNegative, 6 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 13.8s, 0 MoverChecksTotal, 2994 CheckedPairsTotal, 159 TotalNumberOfCompositions - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; [L1695] 0 struct device *my_dev; [L1727] 0 return 0; [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1700] 1 data->shared.b VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1700] 2 data->shared.b = data->shared.b + 1 [L1701] 2 return 0; [L1700] 1 data->shared.b = data->shared.b + 1 [L1701] 1 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 51.6s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 26.0s, HoareTripleCheckerStatistics: 121 SDtfs, 96 SDslu, 125 SDs, 0 SdLazy, 424 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 135 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 45 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...