/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:15:18,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:15:18,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:15:18,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:15:18,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:15:18,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:15:18,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:15:18,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:15:18,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:15:18,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:15:18,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:15:18,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:15:18,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:15:18,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:15:18,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:15:18,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:15:18,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:15:18,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:15:18,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:15:18,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:15:18,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:15:18,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:15:18,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:15:18,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:15:18,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:15:18,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:15:18,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:15:18,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:15:18,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:15:18,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:15:18,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:15:18,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:15:18,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:15:18,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:15:18,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:15:18,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:15:18,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:15:18,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:15:18,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:15:18,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:15:18,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:15:18,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-MCR.epf [2019-12-27 17:15:18,691 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:15:18,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:15:18,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:15:18,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:15:18,693 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:15:18,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:15:18,694 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:15:18,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:15:18,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:15:18,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:15:18,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:15:18,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:15:18,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:15:18,695 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:15:18,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:15:18,696 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:15:18,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:15:18,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:15:18,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:15:18,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:15:18,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:15:18,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:15:18,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:15:18,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:15:18,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:15:18,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:15:18,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:15:18,698 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:15:18,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:15:18,698 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:15:18,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:15:18,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:15:18,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:15:18,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:15:18,990 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:15:18,990 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:15:18,991 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_pso.oepc.i [2019-12-27 17:15:19,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667b6c254/c7a4295f066b4aafa3d7e193aa07a8c4/FLAG6850d04f5 [2019-12-27 17:15:19,621 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:15:19,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_pso.oepc.i [2019-12-27 17:15:19,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667b6c254/c7a4295f066b4aafa3d7e193aa07a8c4/FLAG6850d04f5 [2019-12-27 17:15:19,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667b6c254/c7a4295f066b4aafa3d7e193aa07a8c4 [2019-12-27 17:15:19,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:15:19,930 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:15:19,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:15:19,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:15:19,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:15:19,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:15:19" (1/1) ... [2019-12-27 17:15:19,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db17df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:19, skipping insertion in model container [2019-12-27 17:15:19,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:15:19" (1/1) ... [2019-12-27 17:15:19,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:15:20,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:15:20,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:15:20,591 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:15:20,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:15:20,747 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:15:20,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:20 WrapperNode [2019-12-27 17:15:20,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:15:20,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:15:20,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:15:20,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:15:20,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:20" (1/1) ... [2019-12-27 17:15:20,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:20" (1/1) ... [2019-12-27 17:15:20,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:15:20,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:15:20,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:15:20,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:15:20,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:20" (1/1) ... [2019-12-27 17:15:20,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:20" (1/1) ... [2019-12-27 17:15:20,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:20" (1/1) ... [2019-12-27 17:15:20,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:20" (1/1) ... [2019-12-27 17:15:20,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:20" (1/1) ... [2019-12-27 17:15:20,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:20" (1/1) ... [2019-12-27 17:15:20,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:20" (1/1) ... [2019-12-27 17:15:20,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:15:20,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:15:20,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:15:20,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:15:20,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:15:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:15:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:15:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:15:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:15:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:15:20,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:15:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:15:20,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:15:20,941 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:15:20,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:15:20,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:15:20,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:15:20,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:15:20,944 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:15:21,910 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:15:21,910 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:15:21,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:15:21 BoogieIcfgContainer [2019-12-27 17:15:21,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:15:21,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:15:21,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:15:21,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:15:21,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:15:19" (1/3) ... [2019-12-27 17:15:21,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9fa2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:15:21, skipping insertion in model container [2019-12-27 17:15:21,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:15:20" (2/3) ... [2019-12-27 17:15:21,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9fa2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:15:21, skipping insertion in model container [2019-12-27 17:15:21,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:15:21" (3/3) ... [2019-12-27 17:15:21,921 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_pso.oepc.i [2019-12-27 17:15:21,931 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:15:21,932 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:15:21,940 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:15:21,941 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:15:21,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,994 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,994 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:21,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,027 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,027 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,077 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,079 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,094 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,094 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:15:22,113 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:15:22,134 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:15:22,134 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:15:22,134 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:15:22,135 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:15:22,135 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:15:22,135 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:15:22,135 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:15:22,135 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:15:22,152 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 17:15:22,154 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 17:15:22,287 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 17:15:22,287 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:15:22,310 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:15:22,335 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 17:15:22,446 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 17:15:22,446 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:15:22,459 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:15:22,484 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 17:15:22,485 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:15:28,057 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 17:15:28,189 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 17:15:28,566 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-27 17:15:28,566 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 17:15:28,570 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 17:15:53,007 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 17:15:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 17:15:53,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:15:53,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:53,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:15:53,016 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:53,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:53,022 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-27 17:15:53,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:53,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267579550] [2019-12-27 17:15:53,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:15:53,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267579550] [2019-12-27 17:15:53,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:53,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:15:53,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [387146940] [2019-12-27 17:15:53,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:53,232 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:53,244 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:15:53,244 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:53,251 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:53,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:15:53,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:53,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:15:53,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:15:53,267 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 17:15:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:54,533 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-27 17:15:54,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:15:54,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:15:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:58,549 INFO L225 Difference]: With dead ends: 125570 [2019-12-27 17:15:58,550 INFO L226 Difference]: Without dead ends: 111010 [2019-12-27 17:15:58,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:16:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-27 17:16:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-27 17:16:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-27 17:16:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-27 17:16:11,019 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-27 17:16:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:11,020 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-27 17:16:11,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:16:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-27 17:16:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:16:11,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:11,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:11,025 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:11,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-27 17:16:11,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:11,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206836820] [2019-12-27 17:16:11,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:11,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206836820] [2019-12-27 17:16:11,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:11,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:16:11,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1406330420] [2019-12-27 17:16:11,161 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:11,162 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:11,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:16:11,169 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:11,169 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:16:11,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:16:11,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:11,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:16:11,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:16:11,172 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-27 17:16:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:12,388 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-27 17:16:12,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:16:12,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:16:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:14,044 INFO L225 Difference]: With dead ends: 172646 [2019-12-27 17:16:14,044 INFO L226 Difference]: Without dead ends: 172548 [2019-12-27 17:16:14,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:16:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-27 17:16:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-27 17:16:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-27 17:16:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-27 17:16:33,978 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-27 17:16:33,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:33,979 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-27 17:16:33,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:16:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-27 17:16:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:16:33,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:33,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:33,989 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:33,989 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-27 17:16:33,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:33,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663396240] [2019-12-27 17:16:33,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:34,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663396240] [2019-12-27 17:16:34,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:34,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:16:34,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [583968706] [2019-12-27 17:16:34,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:34,055 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:34,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:16:34,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:34,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:16:34,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:16:34,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:34,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:16:34,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:16:34,059 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-27 17:16:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:34,224 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-27 17:16:34,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:16:34,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:16:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:34,338 INFO L225 Difference]: With dead ends: 34208 [2019-12-27 17:16:34,339 INFO L226 Difference]: Without dead ends: 34208 [2019-12-27 17:16:34,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:16:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-27 17:16:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-27 17:16:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-27 17:16:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-27 17:16:35,176 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-27 17:16:35,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:35,177 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-27 17:16:35,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:16:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-27 17:16:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:16:35,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:35,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:35,181 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:35,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:35,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-27 17:16:35,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:35,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522556867] [2019-12-27 17:16:35,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:35,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522556867] [2019-12-27 17:16:35,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:35,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:16:35,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834700824] [2019-12-27 17:16:35,258 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:35,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:35,262 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:16:35,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:35,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:16:35,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:16:35,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:35,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:16:35,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:16:35,264 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-27 17:16:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:35,472 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-27 17:16:35,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:16:35,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:16:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:35,581 INFO L225 Difference]: With dead ends: 51809 [2019-12-27 17:16:35,581 INFO L226 Difference]: Without dead ends: 51809 [2019-12-27 17:16:35,581 INFO L631 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 [2019-12-27 17:16:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-27 17:16:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-27 17:16:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-27 17:16:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-27 17:16:37,425 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-27 17:16:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:37,427 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-27 17:16:37,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:16:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-27 17:16:37,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:16:37,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:37,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:37,431 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:37,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:37,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-27 17:16:37,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:37,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094298032] [2019-12-27 17:16:37,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:37,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094298032] [2019-12-27 17:16:37,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:37,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:16:37,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [126251906] [2019-12-27 17:16:37,547 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:37,550 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:37,553 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:16:37,553 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:37,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:16:37,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:16:37,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:37,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:16:37,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:16:37,555 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-27 17:16:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:38,121 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-27 17:16:38,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:16:38,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 17:16:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:38,215 INFO L225 Difference]: With dead ends: 53507 [2019-12-27 17:16:38,215 INFO L226 Difference]: Without dead ends: 53507 [2019-12-27 17:16:38,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:16:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-27 17:16:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-27 17:16:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-27 17:16:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-27 17:16:39,591 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-27 17:16:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:39,591 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-27 17:16:39,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:16:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-27 17:16:39,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:16:39,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:39,605 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:39,605 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:39,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:39,605 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-27 17:16:39,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:39,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607141818] [2019-12-27 17:16:39,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:39,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607141818] [2019-12-27 17:16:39,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:39,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:16:39,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [91088957] [2019-12-27 17:16:39,743 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:39,747 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:39,753 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 17:16:39,753 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:39,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:16:39,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:16:39,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:16:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:16:39,795 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 7 states. [2019-12-27 17:16:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:40,822 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-27 17:16:40,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:16:40,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 17:16:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:41,510 INFO L225 Difference]: With dead ends: 66834 [2019-12-27 17:16:41,510 INFO L226 Difference]: Without dead ends: 66820 [2019-12-27 17:16:41,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:16:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-27 17:16:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-27 17:16:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-27 17:16:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-27 17:16:42,414 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-27 17:16:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:42,414 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-27 17:16:42,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:16:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-27 17:16:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:16:42,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:42,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:42,434 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-27 17:16:42,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:42,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915301992] [2019-12-27 17:16:42,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:42,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915301992] [2019-12-27 17:16:42,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:42,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:16:42,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [271735624] [2019-12-27 17:16:42,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:42,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:42,503 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 17:16:42,503 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:42,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:16:42,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:16:42,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:42,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:16:42,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:16:42,521 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 5 states. [2019-12-27 17:16:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:42,609 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-27 17:16:42,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:16:42,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:16:42,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:42,638 INFO L225 Difference]: With dead ends: 18127 [2019-12-27 17:16:42,638 INFO L226 Difference]: Without dead ends: 18127 [2019-12-27 17:16:42,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:16:42,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-27 17:16:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-27 17:16:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-27 17:16:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-27 17:16:43,400 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-27 17:16:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:43,401 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-27 17:16:43,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:16:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-27 17:16:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:16:43,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:43,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:43,415 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:43,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:43,415 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-27 17:16:43,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:43,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774074776] [2019-12-27 17:16:43,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:43,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774074776] [2019-12-27 17:16:43,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:43,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:16:43,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [115731266] [2019-12-27 17:16:43,533 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:43,537 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:43,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:16:43,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:43,543 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:16:43,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:16:43,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:43,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:16:43,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:16:43,544 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-27 17:16:44,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:44,225 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-27 17:16:44,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:16:44,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:16:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:44,263 INFO L225 Difference]: With dead ends: 25206 [2019-12-27 17:16:44,263 INFO L226 Difference]: Without dead ends: 25206 [2019-12-27 17:16:44,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:16:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-27 17:16:44,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-27 17:16:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-27 17:16:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-27 17:16:44,658 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-27 17:16:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:44,658 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-27 17:16:44,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:16:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-27 17:16:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:16:44,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:44,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:44,683 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:44,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:44,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-27 17:16:44,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:44,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747682071] [2019-12-27 17:16:44,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:44,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747682071] [2019-12-27 17:16:44,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:44,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:16:44,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135610276] [2019-12-27 17:16:44,779 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:44,784 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:44,796 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 17:16:44,796 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:44,813 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:16:44,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:16:44,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:44,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:16:44,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:16:44,815 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 8 states. [2019-12-27 17:16:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:46,132 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-27 17:16:46,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:16:46,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 17:16:46,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:46,174 INFO L225 Difference]: With dead ends: 28185 [2019-12-27 17:16:46,174 INFO L226 Difference]: Without dead ends: 28185 [2019-12-27 17:16:46,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:16:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-27 17:16:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-27 17:16:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-27 17:16:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-27 17:16:46,964 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-27 17:16:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:46,965 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-27 17:16:46,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:16:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-27 17:16:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:16:46,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:46,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:46,994 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:46,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:46,995 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-27 17:16:46,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:46,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615973341] [2019-12-27 17:16:46,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:47,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615973341] [2019-12-27 17:16:47,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:47,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:16:47,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1798333797] [2019-12-27 17:16:47,082 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:47,089 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:47,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 287 transitions. [2019-12-27 17:16:47,133 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:47,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:16:47,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:16:47,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:47,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:16:47,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:16:47,183 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 7 states. [2019-12-27 17:16:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:47,287 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-27 17:16:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:16:47,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 17:16:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:47,314 INFO L225 Difference]: With dead ends: 18279 [2019-12-27 17:16:47,315 INFO L226 Difference]: Without dead ends: 18279 [2019-12-27 17:16:47,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:16:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-27 17:16:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-27 17:16:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-27 17:16:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-27 17:16:47,605 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-27 17:16:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:47,605 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-27 17:16:47,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:16:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-27 17:16:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:16:47,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:47,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:47,629 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:47,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-27 17:16:47,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:47,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723013640] [2019-12-27 17:16:47,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:47,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723013640] [2019-12-27 17:16:47,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:47,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:16:47,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [601148574] [2019-12-27 17:16:47,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:47,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:47,956 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 313 transitions. [2019-12-27 17:16:47,957 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:47,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:16:47,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:16:47,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:47,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:16:47,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:16:47,977 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-27 17:16:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:48,977 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-27 17:16:48,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:16:48,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 17:16:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:49,034 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 17:16:49,035 INFO L226 Difference]: Without dead ends: 38006 [2019-12-27 17:16:49,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:16:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-27 17:16:49,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-27 17:16:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-27 17:16:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-27 17:16:49,546 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-27 17:16:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:49,546 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-27 17:16:49,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:16:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-27 17:16:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:16:49,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:49,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:49,573 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:49,573 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-27 17:16:49,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:49,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200076746] [2019-12-27 17:16:49,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:49,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200076746] [2019-12-27 17:16:49,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:49,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:16:49,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1220200024] [2019-12-27 17:16:49,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:49,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:49,890 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 326 transitions. [2019-12-27 17:16:49,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:49,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:16:49,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:16:49,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:16:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:16:49,948 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 10 states. [2019-12-27 17:16:52,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:52,579 INFO L93 Difference]: Finished difference Result 67378 states and 209411 transitions. [2019-12-27 17:16:52,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 17:16:52,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 17:16:52,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:52,652 INFO L225 Difference]: With dead ends: 67378 [2019-12-27 17:16:52,653 INFO L226 Difference]: Without dead ends: 49917 [2019-12-27 17:16:52,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:16:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49917 states. [2019-12-27 17:16:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49917 to 24743. [2019-12-27 17:16:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-27 17:16:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-27 17:16:53,282 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-27 17:16:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:53,283 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-27 17:16:53,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:16:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-27 17:16:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:16:53,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:53,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:53,321 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:53,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-27 17:16:53,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:53,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515423071] [2019-12-27 17:16:53,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:53,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515423071] [2019-12-27 17:16:53,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:53,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:16:53,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [965023424] [2019-12-27 17:16:53,424 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:53,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:53,596 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 267 transitions. [2019-12-27 17:16:53,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:53,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:16:53,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:16:53,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:53,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:16:53,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:16:53,623 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 9 states. [2019-12-27 17:16:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:55,230 INFO L93 Difference]: Finished difference Result 83473 states and 258770 transitions. [2019-12-27 17:16:55,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 17:16:55,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 17:16:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:55,343 INFO L225 Difference]: With dead ends: 83473 [2019-12-27 17:16:55,343 INFO L226 Difference]: Without dead ends: 76594 [2019-12-27 17:16:55,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:16:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76594 states. [2019-12-27 17:16:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76594 to 24923. [2019-12-27 17:16:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-27 17:16:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-27 17:16:56,148 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-27 17:16:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:56,148 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-27 17:16:56,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:16:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-27 17:16:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:16:56,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:56,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:56,187 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:56,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:56,187 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-27 17:16:56,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:56,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281006253] [2019-12-27 17:16:56,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:56,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281006253] [2019-12-27 17:16:56,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:56,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:16:56,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1874569840] [2019-12-27 17:16:56,267 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:56,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:56,580 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 500 transitions. [2019-12-27 17:16:56,580 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:56,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:16:56,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:16:56,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:56,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:16:56,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:16:56,594 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 4 states. [2019-12-27 17:16:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:57,402 INFO L93 Difference]: Finished difference Result 29331 states and 90024 transitions. [2019-12-27 17:16:57,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:16:57,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 17:16:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:57,447 INFO L225 Difference]: With dead ends: 29331 [2019-12-27 17:16:57,447 INFO L226 Difference]: Without dead ends: 29331 [2019-12-27 17:16:57,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:16:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29331 states. [2019-12-27 17:16:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29331 to 19827. [2019-12-27 17:16:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-27 17:16:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-27 17:16:57,822 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-27 17:16:57,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:57,822 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-27 17:16:57,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:16:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-27 17:16:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:16:57,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:57,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:57,844 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:57,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:57,844 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-27 17:16:57,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:57,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742854598] [2019-12-27 17:16:57,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:57,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742854598] [2019-12-27 17:16:57,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:57,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:16:57,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [697489324] [2019-12-27 17:16:57,924 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:57,944 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:58,089 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 318 transitions. [2019-12-27 17:16:58,090 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:58,090 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:16:58,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:16:58,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:58,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:16:58,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:16:58,091 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-27 17:16:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:58,206 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-27 17:16:58,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:16:58,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:16:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:58,238 INFO L225 Difference]: With dead ends: 24197 [2019-12-27 17:16:58,238 INFO L226 Difference]: Without dead ends: 24197 [2019-12-27 17:16:58,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:16:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-27 17:16:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-27 17:16:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-27 17:16:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-27 17:16:58,588 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-27 17:16:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:16:58,588 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-27 17:16:58,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:16:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-27 17:16:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:16:58,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:16:58,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:16:58,611 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:16:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:16:58,611 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-27 17:16:58,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:16:58,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3978043] [2019-12-27 17:16:58,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:16:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:16:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:16:58,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3978043] [2019-12-27 17:16:58,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:16:58,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:16:58,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1618433097] [2019-12-27 17:16:58,707 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:16:58,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:16:59,530 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 289 transitions. [2019-12-27 17:16:59,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:16:59,532 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:16:59,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:16:59,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:16:59,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:16:59,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:16:59,533 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-27 17:16:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:16:59,769 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-27 17:16:59,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:16:59,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 17:16:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:16:59,819 INFO L225 Difference]: With dead ends: 24621 [2019-12-27 17:16:59,819 INFO L226 Difference]: Without dead ends: 24621 [2019-12-27 17:16:59,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:16:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-27 17:17:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-27 17:17:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-27 17:17:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-27 17:17:00,367 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-27 17:17:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:00,368 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-27 17:17:00,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:17:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-27 17:17:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:17:00,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:00,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:00,408 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:17:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-27 17:17:00,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:00,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105023987] [2019-12-27 17:17:00,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:17:00,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105023987] [2019-12-27 17:17:00,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:00,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:17:00,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [636372462] [2019-12-27 17:17:00,601 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:00,622 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:00,793 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 321 transitions. [2019-12-27 17:17:00,793 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:00,918 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:17:00,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:17:00,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:00,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:17:00,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:17:00,919 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 12 states. [2019-12-27 17:17:03,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:03,916 INFO L93 Difference]: Finished difference Result 38488 states and 118451 transitions. [2019-12-27 17:17:03,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:17:03,917 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 17:17:03,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:03,965 INFO L225 Difference]: With dead ends: 38488 [2019-12-27 17:17:03,965 INFO L226 Difference]: Without dead ends: 30672 [2019-12-27 17:17:03,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:17:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30672 states. [2019-12-27 17:17:04,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30672 to 21745. [2019-12-27 17:17:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21745 states. [2019-12-27 17:17:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21745 states to 21745 states and 67061 transitions. [2019-12-27 17:17:04,366 INFO L78 Accepts]: Start accepts. Automaton has 21745 states and 67061 transitions. Word has length 66 [2019-12-27 17:17:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:04,366 INFO L462 AbstractCegarLoop]: Abstraction has 21745 states and 67061 transitions. [2019-12-27 17:17:04,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:17:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 21745 states and 67061 transitions. [2019-12-27 17:17:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:17:04,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:04,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:04,391 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:17:04,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:04,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-27 17:17:04,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:04,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949963345] [2019-12-27 17:17:04,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:17:04,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949963345] [2019-12-27 17:17:04,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:04,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:17:04,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [204225705] [2019-12-27 17:17:04,578 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:04,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:04,785 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 340 transitions. [2019-12-27 17:17:04,785 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:04,902 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:17:04,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:17:04,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:04,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:17:04,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:17:04,903 INFO L87 Difference]: Start difference. First operand 21745 states and 67061 transitions. Second operand 13 states. [2019-12-27 17:17:07,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:07,959 INFO L93 Difference]: Finished difference Result 45951 states and 140703 transitions. [2019-12-27 17:17:07,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 17:17:07,959 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 17:17:07,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:08,448 INFO L225 Difference]: With dead ends: 45951 [2019-12-27 17:17:08,448 INFO L226 Difference]: Without dead ends: 39991 [2019-12-27 17:17:08,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:17:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39991 states. [2019-12-27 17:17:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39991 to 22197. [2019-12-27 17:17:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22197 states. [2019-12-27 17:17:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22197 states to 22197 states and 68309 transitions. [2019-12-27 17:17:08,890 INFO L78 Accepts]: Start accepts. Automaton has 22197 states and 68309 transitions. Word has length 66 [2019-12-27 17:17:08,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:08,890 INFO L462 AbstractCegarLoop]: Abstraction has 22197 states and 68309 transitions. [2019-12-27 17:17:08,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:17:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 22197 states and 68309 transitions. [2019-12-27 17:17:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:17:08,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:08,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:08,911 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:17:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:08,912 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-27 17:17:08,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:08,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724312371] [2019-12-27 17:17:08,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:17:09,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724312371] [2019-12-27 17:17:09,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:09,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:17:09,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1249450367] [2019-12-27 17:17:09,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:09,092 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:09,394 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 616 transitions. [2019-12-27 17:17:09,394 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:09,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:17:09,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:17:09,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 17:17:10,102 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:17:10,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:17:10,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:10,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:17:10,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:17:10,103 INFO L87 Difference]: Start difference. First operand 22197 states and 68309 transitions. Second operand 19 states. [2019-12-27 17:17:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:13,768 INFO L93 Difference]: Finished difference Result 34983 states and 107283 transitions. [2019-12-27 17:17:13,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:17:13,769 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-27 17:17:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:13,809 INFO L225 Difference]: With dead ends: 34983 [2019-12-27 17:17:13,809 INFO L226 Difference]: Without dead ends: 31500 [2019-12-27 17:17:13,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-12-27 17:17:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31500 states. [2019-12-27 17:17:14,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31500 to 21765. [2019-12-27 17:17:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-12-27 17:17:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 66977 transitions. [2019-12-27 17:17:14,211 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 66977 transitions. Word has length 66 [2019-12-27 17:17:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:14,212 INFO L462 AbstractCegarLoop]: Abstraction has 21765 states and 66977 transitions. [2019-12-27 17:17:14,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:17:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 66977 transitions. [2019-12-27 17:17:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:17:14,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:14,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:14,234 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:17:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-27 17:17:14,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:14,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363453508] [2019-12-27 17:17:14,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:17:14,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363453508] [2019-12-27 17:17:14,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:14,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:17:14,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [506421702] [2019-12-27 17:17:14,538 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:14,557 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:14,710 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 323 transitions. [2019-12-27 17:17:14,711 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:14,945 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:17:14,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 17:17:14,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:14,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 17:17:14,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:17:14,947 INFO L87 Difference]: Start difference. First operand 21765 states and 66977 transitions. Second operand 17 states. [2019-12-27 17:17:20,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:20,960 INFO L93 Difference]: Finished difference Result 37223 states and 111519 transitions. [2019-12-27 17:17:20,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 17:17:20,961 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 17:17:20,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:21,008 INFO L225 Difference]: With dead ends: 37223 [2019-12-27 17:17:21,008 INFO L226 Difference]: Without dead ends: 36959 [2019-12-27 17:17:21,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=544, Invalid=2648, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 17:17:21,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36959 states. [2019-12-27 17:17:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36959 to 27801. [2019-12-27 17:17:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27801 states. [2019-12-27 17:17:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27801 states to 27801 states and 84914 transitions. [2019-12-27 17:17:21,500 INFO L78 Accepts]: Start accepts. Automaton has 27801 states and 84914 transitions. Word has length 66 [2019-12-27 17:17:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:21,501 INFO L462 AbstractCegarLoop]: Abstraction has 27801 states and 84914 transitions. [2019-12-27 17:17:21,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 17:17:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 27801 states and 84914 transitions. [2019-12-27 17:17:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:17:21,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:21,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:21,532 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:17:21,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:21,533 INFO L82 PathProgramCache]: Analyzing trace with hash 883991506, now seen corresponding path program 5 times [2019-12-27 17:17:21,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:21,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947407016] [2019-12-27 17:17:21,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:17:21,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947407016] [2019-12-27 17:17:21,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:21,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:17:21,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2111606505] [2019-12-27 17:17:21,638 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:21,654 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:21,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 331 transitions. [2019-12-27 17:17:21,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:21,944 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:17:21,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:17:21,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:17:21,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:17:21,945 INFO L87 Difference]: Start difference. First operand 27801 states and 84914 transitions. Second operand 13 states. [2019-12-27 17:17:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:24,311 INFO L93 Difference]: Finished difference Result 39817 states and 118762 transitions. [2019-12-27 17:17:24,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 17:17:24,312 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 17:17:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:24,363 INFO L225 Difference]: With dead ends: 39817 [2019-12-27 17:17:24,363 INFO L226 Difference]: Without dead ends: 39717 [2019-12-27 17:17:24,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:17:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39717 states. [2019-12-27 17:17:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39717 to 30159. [2019-12-27 17:17:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30159 states. [2019-12-27 17:17:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30159 states to 30159 states and 91762 transitions. [2019-12-27 17:17:25,320 INFO L78 Accepts]: Start accepts. Automaton has 30159 states and 91762 transitions. Word has length 66 [2019-12-27 17:17:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:25,320 INFO L462 AbstractCegarLoop]: Abstraction has 30159 states and 91762 transitions. [2019-12-27 17:17:25,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:17:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 30159 states and 91762 transitions. [2019-12-27 17:17:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:17:25,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:25,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:25,352 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:17:25,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:25,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1390949788, now seen corresponding path program 6 times [2019-12-27 17:17:25,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:25,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749275973] [2019-12-27 17:17:25,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:17:25,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749275973] [2019-12-27 17:17:25,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:25,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:17:25,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1281218801] [2019-12-27 17:17:25,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:25,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:25,706 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 355 transitions. [2019-12-27 17:17:25,706 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:26,684 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-12-27 17:17:26,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 17:17:26,924 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 17:17:26,926 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 17:17:26,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 17:17:26,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:26,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 17:17:26,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:17:26,928 INFO L87 Difference]: Start difference. First operand 30159 states and 91762 transitions. Second operand 28 states. [2019-12-27 17:17:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:17:54,254 INFO L93 Difference]: Finished difference Result 136921 states and 405385 transitions. [2019-12-27 17:17:54,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-12-27 17:17:54,255 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2019-12-27 17:17:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:17:54,377 INFO L225 Difference]: With dead ends: 136921 [2019-12-27 17:17:54,378 INFO L226 Difference]: Without dead ends: 87037 [2019-12-27 17:17:54,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13785 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=5307, Invalid=33699, Unknown=0, NotChecked=0, Total=39006 [2019-12-27 17:17:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87037 states. [2019-12-27 17:17:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87037 to 40454. [2019-12-27 17:17:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40454 states. [2019-12-27 17:17:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40454 states to 40454 states and 122662 transitions. [2019-12-27 17:17:55,383 INFO L78 Accepts]: Start accepts. Automaton has 40454 states and 122662 transitions. Word has length 66 [2019-12-27 17:17:55,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:17:55,383 INFO L462 AbstractCegarLoop]: Abstraction has 40454 states and 122662 transitions. [2019-12-27 17:17:55,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 17:17:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 40454 states and 122662 transitions. [2019-12-27 17:17:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:17:55,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:17:55,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:17:55,425 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:17:55,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:17:55,425 INFO L82 PathProgramCache]: Analyzing trace with hash -793831102, now seen corresponding path program 7 times [2019-12-27 17:17:55,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:17:55,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826243525] [2019-12-27 17:17:55,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:17:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:17:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:17:55,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826243525] [2019-12-27 17:17:55,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:17:55,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:17:55,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17901841] [2019-12-27 17:17:55,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:17:55,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:17:55,983 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 309 states and 632 transitions. [2019-12-27 17:17:55,983 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:17:56,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:17:56,249 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 17:17:56,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:17:56,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:17:56,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:17:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:17:56,250 INFO L87 Difference]: Start difference. First operand 40454 states and 122662 transitions. Second operand 16 states. [2019-12-27 17:18:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:18:02,682 INFO L93 Difference]: Finished difference Result 75181 states and 223311 transitions. [2019-12-27 17:18:02,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 17:18:02,683 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 17:18:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:18:02,791 INFO L225 Difference]: With dead ends: 75181 [2019-12-27 17:18:02,791 INFO L226 Difference]: Without dead ends: 75053 [2019-12-27 17:18:02,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=557, Invalid=3225, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 17:18:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75053 states. [2019-12-27 17:18:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75053 to 35873. [2019-12-27 17:18:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35873 states. [2019-12-27 17:18:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35873 states to 35873 states and 109120 transitions. [2019-12-27 17:18:03,687 INFO L78 Accepts]: Start accepts. Automaton has 35873 states and 109120 transitions. Word has length 66 [2019-12-27 17:18:03,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:18:03,688 INFO L462 AbstractCegarLoop]: Abstraction has 35873 states and 109120 transitions. [2019-12-27 17:18:03,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:18:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand 35873 states and 109120 transitions. [2019-12-27 17:18:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:18:03,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:18:03,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:18:03,726 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:18:03,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:18:03,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1722915508, now seen corresponding path program 8 times [2019-12-27 17:18:03,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:18:03,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178495241] [2019-12-27 17:18:03,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:18:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:18:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:18:04,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178495241] [2019-12-27 17:18:04,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:18:04,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 17:18:04,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1430379197] [2019-12-27 17:18:04,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:18:04,353 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:18:04,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 274 states and 490 transitions. [2019-12-27 17:18:04,693 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:18:05,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:18:05,329 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 17:18:05,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 17:18:05,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:18:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 17:18:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-12-27 17:18:05,331 INFO L87 Difference]: Start difference. First operand 35873 states and 109120 transitions. Second operand 29 states. [2019-12-27 17:18:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:18:29,439 INFO L93 Difference]: Finished difference Result 58605 states and 170618 transitions. [2019-12-27 17:18:29,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-12-27 17:18:29,440 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 66 [2019-12-27 17:18:29,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:18:29,511 INFO L225 Difference]: With dead ends: 58605 [2019-12-27 17:18:29,511 INFO L226 Difference]: Without dead ends: 53240 [2019-12-27 17:18:29,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8672 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2064, Invalid=23376, Unknown=0, NotChecked=0, Total=25440 [2019-12-27 17:18:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53240 states. [2019-12-27 17:18:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53240 to 30040. [2019-12-27 17:18:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30040 states. [2019-12-27 17:18:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30040 states to 30040 states and 90210 transitions. [2019-12-27 17:18:30,134 INFO L78 Accepts]: Start accepts. Automaton has 30040 states and 90210 transitions. Word has length 66 [2019-12-27 17:18:30,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:18:30,134 INFO L462 AbstractCegarLoop]: Abstraction has 30040 states and 90210 transitions. [2019-12-27 17:18:30,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 17:18:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 30040 states and 90210 transitions. [2019-12-27 17:18:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:18:30,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:18:30,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:18:30,166 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:18:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:18:30,166 INFO L82 PathProgramCache]: Analyzing trace with hash 742453144, now seen corresponding path program 9 times [2019-12-27 17:18:30,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:18:30,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41161782] [2019-12-27 17:18:30,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:18:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:18:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:18:30,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41161782] [2019-12-27 17:18:30,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:18:30,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 17:18:30,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1409382040] [2019-12-27 17:18:30,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:18:30,601 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:18:30,854 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 339 states and 705 transitions. [2019-12-27 17:18:30,854 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:18:31,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:18:31,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:18:31,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:18:31,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:18:31,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:18:31,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:18:31,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:18:31,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:18:32,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:18:32,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:18:32,297 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 43 times. [2019-12-27 17:18:32,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 17:18:32,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:18:32,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 17:18:32,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 17:18:32,299 INFO L87 Difference]: Start difference. First operand 30040 states and 90210 transitions. Second operand 37 states. [2019-12-27 17:18:32,935 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2019-12-27 17:18:33,093 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2019-12-27 17:18:33,811 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2019-12-27 17:18:34,763 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2019-12-27 17:18:34,927 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 28 [2019-12-27 17:18:35,670 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-12-27 17:18:38,719 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-27 17:18:39,006 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-27 17:18:41,357 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 39 [2019-12-27 17:18:41,517 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 26 [2019-12-27 17:18:41,862 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-12-27 17:18:42,715 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 25 [2019-12-27 17:18:43,731 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 27 [2019-12-27 17:18:44,548 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-12-27 17:18:45,345 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-12-27 17:18:46,607 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2019-12-27 17:18:47,757 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-12-27 17:18:48,526 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-12-27 17:18:48,739 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-12-27 17:18:50,132 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-12-27 17:18:52,015 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-12-27 17:18:59,307 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-12-27 17:18:59,641 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 Received shutdown request... [2019-12-27 17:18:59,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-12-27 17:18:59,740 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 17:18:59,744 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 17:18:59,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:18:59 BasicIcfg [2019-12-27 17:18:59,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:18:59,746 INFO L168 Benchmark]: Toolchain (without parser) took 219817.19 ms. Allocated memory was 145.2 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 101.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 17:18:59,747 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:18:59,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.54 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 156.4 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:18:59,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.88 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:18:59,750 INFO L168 Benchmark]: Boogie Preprocessor took 39.86 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:18:59,751 INFO L168 Benchmark]: RCFGBuilder took 1057.33 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 100.9 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:18:59,754 INFO L168 Benchmark]: TraceAbstraction took 217831.41 ms. Allocated memory was 202.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 100.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 17:18:59,760 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.54 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 156.4 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.88 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.86 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1057.33 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 100.9 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 217831.41 ms. Allocated memory was 202.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 100.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (30040states) and FLOYD_HOARE automaton (currently 172 states, 37 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 187 known predicates. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (30040states) and FLOYD_HOARE automaton (currently 172 states, 37 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 187 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: TIMEOUT, OverallTime: 217.6s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 124.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7987 SDtfs, 13413 SDslu, 45770 SDs, 0 SdLazy, 68487 SolverSat, 1348 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 63.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1096 GetRequests, 152 SyntacticMatches, 64 SemanticMatches, 879 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37566 ImplicationChecksByTransitivity, 39.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 346266 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1186 NumberOfCodeBlocks, 1186 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1161 ConstructedInterpolants, 0 QuantifiedInterpolants, 301344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown