/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:54:31,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:54:31,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:54:31,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:54:31,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:54:31,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:54:31,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:54:31,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:54:31,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:54:31,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:54:31,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:54:31,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:54:31,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:54:31,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:54:31,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:54:31,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:54:31,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:54:31,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:54:31,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:54:31,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:54:31,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:54:31,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:54:31,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:54:31,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:54:31,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:54:31,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:54:31,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:54:31,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:54:31,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:54:31,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:54:31,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:54:31,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:54:31,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:54:31,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:54:31,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:54:31,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:54:31,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:54:31,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:54:31,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:54:31,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:54:31,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:54:31,683 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-NoLbe-MCR.epf [2019-12-28 03:54:31,717 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:54:31,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:54:31,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:54:31,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:54:31,723 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:54:31,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:54:31,724 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:54:31,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:54:31,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:54:31,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:54:31,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:54:31,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:54:31,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:54:31,725 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:54:31,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:54:31,725 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:54:31,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:54:31,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:54:31,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:54:31,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:54:31,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:54:31,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:54:31,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:54:31,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:54:31,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:54:31,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:54:31,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:54:31,728 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:54:31,728 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:54:31,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:54:31,728 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:54:31,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:54:31,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:54:32,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:54:32,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:54:32,009 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:54:32,009 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:54:32,010 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i [2019-12-28 03:54:32,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bb7fcb2/2f110c95589d406792dbafa9ca792a99/FLAGf08bfb3de [2019-12-28 03:54:32,646 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:54:32,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i [2019-12-28 03:54:32,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bb7fcb2/2f110c95589d406792dbafa9ca792a99/FLAGf08bfb3de [2019-12-28 03:54:32,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bb7fcb2/2f110c95589d406792dbafa9ca792a99 [2019-12-28 03:54:32,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:54:32,898 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:54:32,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:54:32,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:54:32,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:54:32,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:54:32" (1/1) ... [2019-12-28 03:54:32,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3850fc90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:32, skipping insertion in model container [2019-12-28 03:54:32,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:54:32" (1/1) ... [2019-12-28 03:54:32,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:54:32,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:54:33,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:54:33,504 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:54:33,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:54:33,650 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:54:33,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:33 WrapperNode [2019-12-28 03:54:33,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:54:33,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:54:33,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:54:33,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:54:33,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:33" (1/1) ... [2019-12-28 03:54:33,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:33" (1/1) ... [2019-12-28 03:54:33,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:54:33,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:54:33,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:54:33,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:54:33,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:33" (1/1) ... [2019-12-28 03:54:33,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:33" (1/1) ... [2019-12-28 03:54:33,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:33" (1/1) ... [2019-12-28 03:54:33,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:33" (1/1) ... [2019-12-28 03:54:33,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:33" (1/1) ... [2019-12-28 03:54:33,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:33" (1/1) ... [2019-12-28 03:54:33,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:33" (1/1) ... [2019-12-28 03:54:33,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:54:33,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:54:33,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:54:33,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:54:33,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:33" (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-28 03:54:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:54:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:54:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:54:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:54:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:54:33,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:54:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:54:33,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:54:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:54:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:54:33,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:54:33,870 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 03:54:34,888 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:54:34,888 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:54:34,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:54:34 BoogieIcfgContainer [2019-12-28 03:54:34,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:54:34,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:54:34,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:54:34,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:54:34,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:54:32" (1/3) ... [2019-12-28 03:54:34,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e846185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:54:34, skipping insertion in model container [2019-12-28 03:54:34,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:33" (2/3) ... [2019-12-28 03:54:34,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e846185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:54:34, skipping insertion in model container [2019-12-28 03:54:34,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:54:34" (3/3) ... [2019-12-28 03:54:34,922 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_tso.opt.i [2019-12-28 03:54:34,933 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:54:34,933 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:54:34,948 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:54:34,949 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:54:34,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,987 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,987 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:34,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,034 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,038 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:35,054 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:54:35,075 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:54:35,075 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:54:35,075 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:54:35,075 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:54:35,076 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:54:35,076 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:54:35,076 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:54:35,076 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:54:35,092 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 189 places, 244 transitions [2019-12-28 03:54:41,206 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 69535 states. [2019-12-28 03:54:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 69535 states. [2019-12-28 03:54:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-28 03:54:41,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:41,219 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] [2019-12-28 03:54:41,219 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:41,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:41,225 INFO L82 PathProgramCache]: Analyzing trace with hash -800669215, now seen corresponding path program 1 times [2019-12-28 03:54:41,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:41,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423981284] [2019-12-28 03:54:41,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:54:41,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423981284] [2019-12-28 03:54:41,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:41,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:54:41,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [461845104] [2019-12-28 03:54:41,543 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:41,550 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:41,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 38 transitions. [2019-12-28 03:54:41,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:41,576 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:54:41,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:54:41,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:41,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:54:41,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:54:41,594 INFO L87 Difference]: Start difference. First operand 69535 states. Second operand 4 states. [2019-12-28 03:54:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:42,558 INFO L93 Difference]: Finished difference Result 70487 states and 288560 transitions. [2019-12-28 03:54:42,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:54:42,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-28 03:54:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:43,143 INFO L225 Difference]: With dead ends: 70487 [2019-12-28 03:54:43,143 INFO L226 Difference]: Without dead ends: 62935 [2019-12-28 03:54:43,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:54:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62935 states. [2019-12-28 03:54:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62935 to 62935. [2019-12-28 03:54:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62935 states. [2019-12-28 03:54:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62935 states to 62935 states and 260088 transitions. [2019-12-28 03:54:49,656 INFO L78 Accepts]: Start accepts. Automaton has 62935 states and 260088 transitions. Word has length 38 [2019-12-28 03:54:49,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:49,657 INFO L462 AbstractCegarLoop]: Abstraction has 62935 states and 260088 transitions. [2019-12-28 03:54:49,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:54:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 62935 states and 260088 transitions. [2019-12-28 03:54:49,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 03:54:49,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:49,664 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] [2019-12-28 03:54:49,664 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1890140348, now seen corresponding path program 1 times [2019-12-28 03:54:49,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:49,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463553484] [2019-12-28 03:54:49,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:49,811 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-28 03:54:49,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463553484] [2019-12-28 03:54:49,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:49,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:54:49,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1448439857] [2019-12-28 03:54:49,813 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:49,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:49,829 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 101 transitions. [2019-12-28 03:54:49,829 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:49,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:54:49,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:54:49,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:49,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:54:49,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:54:49,833 INFO L87 Difference]: Start difference. First operand 62935 states and 260088 transitions. Second operand 5 states. [2019-12-28 03:54:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:51,627 INFO L93 Difference]: Finished difference Result 102409 states and 395806 transitions. [2019-12-28 03:54:51,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:54:51,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-28 03:54:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:52,113 INFO L225 Difference]: With dead ends: 102409 [2019-12-28 03:54:52,113 INFO L226 Difference]: Without dead ends: 102265 [2019-12-28 03:54:52,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:54:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102265 states. [2019-12-28 03:54:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102265 to 100495. [2019-12-28 03:54:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100495 states. [2019-12-28 03:54:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100495 states to 100495 states and 389884 transitions. [2019-12-28 03:54:57,853 INFO L78 Accepts]: Start accepts. Automaton has 100495 states and 389884 transitions. Word has length 45 [2019-12-28 03:54:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:57,855 INFO L462 AbstractCegarLoop]: Abstraction has 100495 states and 389884 transitions. [2019-12-28 03:54:57,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:54:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 100495 states and 389884 transitions. [2019-12-28 03:54:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 03:54:57,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:57,859 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] [2019-12-28 03:54:57,859 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:57,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:57,860 INFO L82 PathProgramCache]: Analyzing trace with hash -267221954, now seen corresponding path program 1 times [2019-12-28 03:54:57,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:57,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292364296] [2019-12-28 03:54:57,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:57,965 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-28 03:54:57,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292364296] [2019-12-28 03:54:57,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:57,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:54:57,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557231408] [2019-12-28 03:54:57,967 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:57,971 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:57,975 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 46 transitions. [2019-12-28 03:54:57,975 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:57,976 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:54:57,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:54:57,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:57,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:54:57,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:54:57,977 INFO L87 Difference]: Start difference. First operand 100495 states and 389884 transitions. Second operand 5 states. [2019-12-28 03:55:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:01,591 INFO L93 Difference]: Finished difference Result 123001 states and 468917 transitions. [2019-12-28 03:55:01,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:55:01,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-28 03:55:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:02,035 INFO L225 Difference]: With dead ends: 123001 [2019-12-28 03:55:02,036 INFO L226 Difference]: Without dead ends: 122841 [2019-12-28 03:55:02,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:55:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122841 states. [2019-12-28 03:55:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122841 to 109850. [2019-12-28 03:55:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109850 states. [2019-12-28 03:55:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109850 states to 109850 states and 422838 transitions. [2019-12-28 03:55:10,694 INFO L78 Accepts]: Start accepts. Automaton has 109850 states and 422838 transitions. Word has length 46 [2019-12-28 03:55:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:10,694 INFO L462 AbstractCegarLoop]: Abstraction has 109850 states and 422838 transitions. [2019-12-28 03:55:10,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:55:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 109850 states and 422838 transitions. [2019-12-28 03:55:10,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:55:10,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:10,711 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] [2019-12-28 03:55:10,711 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:10,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:10,711 INFO L82 PathProgramCache]: Analyzing trace with hash 676097697, now seen corresponding path program 1 times [2019-12-28 03:55:10,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:10,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657856448] [2019-12-28 03:55:10,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:10,801 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-28 03:55:10,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657856448] [2019-12-28 03:55:10,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:10,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:55:10,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [713793862] [2019-12-28 03:55:10,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:10,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:10,821 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 137 transitions. [2019-12-28 03:55:10,821 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:10,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:55:10,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:55:10,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:10,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:55:10,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:55:10,827 INFO L87 Difference]: Start difference. First operand 109850 states and 422838 transitions. Second operand 6 states. [2019-12-28 03:55:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:13,649 INFO L93 Difference]: Finished difference Result 145202 states and 544226 transitions. [2019-12-28 03:55:13,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:55:13,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-28 03:55:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:14,029 INFO L225 Difference]: With dead ends: 145202 [2019-12-28 03:55:14,029 INFO L226 Difference]: Without dead ends: 145058 [2019-12-28 03:55:14,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-28 03:55:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145058 states. [2019-12-28 03:55:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145058 to 108813. [2019-12-28 03:55:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108813 states. [2019-12-28 03:55:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108813 states to 108813 states and 418993 transitions. [2019-12-28 03:55:18,861 INFO L78 Accepts]: Start accepts. Automaton has 108813 states and 418993 transitions. Word has length 53 [2019-12-28 03:55:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:18,861 INFO L462 AbstractCegarLoop]: Abstraction has 108813 states and 418993 transitions. [2019-12-28 03:55:18,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:55:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 108813 states and 418993 transitions. [2019-12-28 03:55:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 03:55:18,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:18,909 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] [2019-12-28 03:55:18,909 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:18,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash 316007622, now seen corresponding path program 1 times [2019-12-28 03:55:18,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:18,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163929154] [2019-12-28 03:55:18,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:19,013 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-28 03:55:19,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163929154] [2019-12-28 03:55:19,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:19,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:55:19,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1336549429] [2019-12-28 03:55:19,016 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:19,025 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:19,034 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 60 transitions. [2019-12-28 03:55:19,035 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:19,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:55:19,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:55:19,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:19,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:55:19,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:55:19,036 INFO L87 Difference]: Start difference. First operand 108813 states and 418993 transitions. Second operand 6 states. [2019-12-28 03:55:21,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:21,400 INFO L93 Difference]: Finished difference Result 145663 states and 546005 transitions. [2019-12-28 03:55:21,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:55:21,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-28 03:55:21,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:21,764 INFO L225 Difference]: With dead ends: 145663 [2019-12-28 03:55:21,764 INFO L226 Difference]: Without dead ends: 145423 [2019-12-28 03:55:21,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:55:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145423 states. [2019-12-28 03:55:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145423 to 130402. [2019-12-28 03:55:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130402 states. [2019-12-28 03:55:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130402 states to 130402 states and 494392 transitions. [2019-12-28 03:55:29,759 INFO L78 Accepts]: Start accepts. Automaton has 130402 states and 494392 transitions. Word has length 60 [2019-12-28 03:55:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:29,759 INFO L462 AbstractCegarLoop]: Abstraction has 130402 states and 494392 transitions. [2019-12-28 03:55:29,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:55:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 130402 states and 494392 transitions. [2019-12-28 03:55:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 03:55:29,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:29,809 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] [2019-12-28 03:55:29,810 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash -392503108, now seen corresponding path program 1 times [2019-12-28 03:55:29,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:29,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178009403] [2019-12-28 03:55:29,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:29,865 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-28 03:55:29,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178009403] [2019-12-28 03:55:29,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:29,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:55:29,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2084694509] [2019-12-28 03:55:29,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:29,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:29,890 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 62 transitions. [2019-12-28 03:55:29,891 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:29,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:55:29,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:55:29,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:29,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:55:29,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:55:29,892 INFO L87 Difference]: Start difference. First operand 130402 states and 494392 transitions. Second operand 3 states. [2019-12-28 03:55:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:31,750 INFO L93 Difference]: Finished difference Result 210818 states and 777868 transitions. [2019-12-28 03:55:31,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:55:31,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-28 03:55:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:32,295 INFO L225 Difference]: With dead ends: 210818 [2019-12-28 03:55:32,295 INFO L226 Difference]: Without dead ends: 210818 [2019-12-28 03:55:32,295 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-28 03:55:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210818 states. [2019-12-28 03:55:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210818 to 187534. [2019-12-28 03:55:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187534 states. [2019-12-28 03:55:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187534 states to 187534 states and 695635 transitions. [2019-12-28 03:55:43,539 INFO L78 Accepts]: Start accepts. Automaton has 187534 states and 695635 transitions. Word has length 62 [2019-12-28 03:55:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:43,540 INFO L462 AbstractCegarLoop]: Abstraction has 187534 states and 695635 transitions. [2019-12-28 03:55:43,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:55:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 187534 states and 695635 transitions. [2019-12-28 03:55:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:55:43,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:43,622 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-28 03:55:43,622 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:43,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:43,623 INFO L82 PathProgramCache]: Analyzing trace with hash 319205498, now seen corresponding path program 1 times [2019-12-28 03:55:43,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:43,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474837] [2019-12-28 03:55:43,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:55:43,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474837] [2019-12-28 03:55:43,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:43,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:55:43,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1467091650] [2019-12-28 03:55:43,774 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:43,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:43,803 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 03:55:43,804 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:43,804 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:55:43,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:55:43,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:43,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:55:43,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:55:43,807 INFO L87 Difference]: Start difference. First operand 187534 states and 695635 transitions. Second operand 7 states. [2019-12-28 03:55:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:51,492 INFO L93 Difference]: Finished difference Result 242757 states and 879896 transitions. [2019-12-28 03:55:51,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 03:55:51,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-28 03:55:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:52,129 INFO L225 Difference]: With dead ends: 242757 [2019-12-28 03:55:52,129 INFO L226 Difference]: Without dead ends: 242517 [2019-12-28 03:55:52,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-28 03:55:54,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242517 states. [2019-12-28 03:55:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242517 to 189100. [2019-12-28 03:55:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189100 states. [2019-12-28 03:55:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189100 states to 189100 states and 700966 transitions. [2019-12-28 03:55:58,616 INFO L78 Accepts]: Start accepts. Automaton has 189100 states and 700966 transitions. Word has length 66 [2019-12-28 03:55:58,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:58,616 INFO L462 AbstractCegarLoop]: Abstraction has 189100 states and 700966 transitions. [2019-12-28 03:55:58,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:55:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 189100 states and 700966 transitions. [2019-12-28 03:55:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:55:58,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:58,707 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, 1] [2019-12-28 03:55:58,707 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:58,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:58,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1112040937, now seen corresponding path program 1 times [2019-12-28 03:55:58,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:58,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271589400] [2019-12-28 03:55:58,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:58,793 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-28 03:55:58,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271589400] [2019-12-28 03:55:58,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:58,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:55:58,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1097104836] [2019-12-28 03:55:58,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:58,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:58,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 151 transitions. [2019-12-28 03:55:58,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:58,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:55:58,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:55:58,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:58,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:55:58,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:55:58,833 INFO L87 Difference]: Start difference. First operand 189100 states and 700966 transitions. Second operand 7 states. [2019-12-28 03:56:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:04,386 INFO L93 Difference]: Finished difference Result 251310 states and 908176 transitions. [2019-12-28 03:56:04,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 03:56:04,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 03:56:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:05,062 INFO L225 Difference]: With dead ends: 251310 [2019-12-28 03:56:05,062 INFO L226 Difference]: Without dead ends: 251110 [2019-12-28 03:56:05,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-28 03:56:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251110 states. [2019-12-28 03:56:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251110 to 198330. [2019-12-28 03:56:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198330 states. [2019-12-28 03:56:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198330 states to 198330 states and 732648 transitions. [2019-12-28 03:56:17,961 INFO L78 Accepts]: Start accepts. Automaton has 198330 states and 732648 transitions. Word has length 67 [2019-12-28 03:56:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:17,961 INFO L462 AbstractCegarLoop]: Abstraction has 198330 states and 732648 transitions. [2019-12-28 03:56:17,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:56:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 198330 states and 732648 transitions. [2019-12-28 03:56:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:56:18,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:18,062 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, 1, 1, 1] [2019-12-28 03:56:18,063 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:18,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1623348742, now seen corresponding path program 1 times [2019-12-28 03:56:18,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:18,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855141918] [2019-12-28 03:56:18,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:19,217 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-28 03:56:19,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855141918] [2019-12-28 03:56:19,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:19,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:56:19,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [890226466] [2019-12-28 03:56:19,218 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:19,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:19,238 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 73 transitions. [2019-12-28 03:56:19,238 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:19,239 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:19,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:56:19,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:19,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:56:19,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:56:19,240 INFO L87 Difference]: Start difference. First operand 198330 states and 732648 transitions. Second operand 6 states. [2019-12-28 03:56:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:27,419 INFO L93 Difference]: Finished difference Result 275504 states and 1015214 transitions. [2019-12-28 03:56:27,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:56:27,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 03:56:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:28,273 INFO L225 Difference]: With dead ends: 275504 [2019-12-28 03:56:28,273 INFO L226 Difference]: Without dead ends: 275504 [2019-12-28 03:56:28,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:56:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275504 states. [2019-12-28 03:56:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275504 to 236435. [2019-12-28 03:56:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236435 states. [2019-12-28 03:56:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236435 states to 236435 states and 875017 transitions. [2019-12-28 03:56:35,924 INFO L78 Accepts]: Start accepts. Automaton has 236435 states and 875017 transitions. Word has length 69 [2019-12-28 03:56:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:35,924 INFO L462 AbstractCegarLoop]: Abstraction has 236435 states and 875017 transitions. [2019-12-28 03:56:35,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:56:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 236435 states and 875017 transitions. [2019-12-28 03:56:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:56:36,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:36,064 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, 1, 1, 1] [2019-12-28 03:56:36,064 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:36,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1710004537, now seen corresponding path program 1 times [2019-12-28 03:56:36,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:36,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367063699] [2019-12-28 03:56:36,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:36,164 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-28 03:56:36,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367063699] [2019-12-28 03:56:36,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:36,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:56:36,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [38620637] [2019-12-28 03:56:36,165 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:36,174 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:36,182 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 73 transitions. [2019-12-28 03:56:36,182 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:36,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:36,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:56:36,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:36,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:56:36,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:56:36,184 INFO L87 Difference]: Start difference. First operand 236435 states and 875017 transitions. Second operand 7 states. [2019-12-28 03:56:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:44,361 INFO L93 Difference]: Finished difference Result 332957 states and 1206203 transitions. [2019-12-28 03:56:44,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:56:44,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 03:56:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:45,958 INFO L225 Difference]: With dead ends: 332957 [2019-12-28 03:56:45,958 INFO L226 Difference]: Without dead ends: 332957 [2019-12-28 03:56:45,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:56:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332957 states. [2019-12-28 03:56:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332957 to 310971. [2019-12-28 03:56:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310971 states. [2019-12-28 03:57:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310971 states to 310971 states and 1133528 transitions. [2019-12-28 03:57:01,254 INFO L78 Accepts]: Start accepts. Automaton has 310971 states and 1133528 transitions. Word has length 69 [2019-12-28 03:57:01,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:01,254 INFO L462 AbstractCegarLoop]: Abstraction has 310971 states and 1133528 transitions. [2019-12-28 03:57:01,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:57:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 310971 states and 1133528 transitions. [2019-12-28 03:57:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:57:01,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:01,445 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, 1, 1, 1] [2019-12-28 03:57:01,446 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:01,446 INFO L82 PathProgramCache]: Analyzing trace with hash -465240056, now seen corresponding path program 1 times [2019-12-28 03:57:01,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:01,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606388098] [2019-12-28 03:57:01,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:01,543 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-28 03:57:01,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606388098] [2019-12-28 03:57:01,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:01,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:57:01,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2061317536] [2019-12-28 03:57:01,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:01,555 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:01,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 73 transitions. [2019-12-28 03:57:01,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:01,606 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:57:01,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:57:01,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:01,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:57:01,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:57:01,607 INFO L87 Difference]: Start difference. First operand 310971 states and 1133528 transitions. Second operand 4 states. [2019-12-28 03:57:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:01,829 INFO L93 Difference]: Finished difference Result 48146 states and 153495 transitions. [2019-12-28 03:57:01,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:57:01,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 03:57:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:02,038 INFO L225 Difference]: With dead ends: 48146 [2019-12-28 03:57:02,038 INFO L226 Difference]: Without dead ends: 46262 [2019-12-28 03:57:02,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 03:57:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46262 states. [2019-12-28 03:57:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46262 to 46188. [2019-12-28 03:57:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46188 states. [2019-12-28 03:57:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46188 states to 46188 states and 147141 transitions. [2019-12-28 03:57:04,603 INFO L78 Accepts]: Start accepts. Automaton has 46188 states and 147141 transitions. Word has length 69 [2019-12-28 03:57:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:04,603 INFO L462 AbstractCegarLoop]: Abstraction has 46188 states and 147141 transitions. [2019-12-28 03:57:04,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:57:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 46188 states and 147141 transitions. [2019-12-28 03:57:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-28 03:57:04,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:04,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:04,674 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1727588247, now seen corresponding path program 1 times [2019-12-28 03:57:04,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:04,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211359983] [2019-12-28 03:57:04,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:04,735 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-28 03:57:04,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211359983] [2019-12-28 03:57:04,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:04,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:57:04,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779486270] [2019-12-28 03:57:04,736 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:04,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:04,795 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 183 transitions. [2019-12-28 03:57:04,795 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:04,872 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:57:04,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:57:04,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:04,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:57:04,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:57:04,873 INFO L87 Difference]: Start difference. First operand 46188 states and 147141 transitions. Second operand 6 states. [2019-12-28 03:57:05,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:05,541 INFO L93 Difference]: Finished difference Result 55992 states and 176874 transitions. [2019-12-28 03:57:05,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:57:05,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-12-28 03:57:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:05,647 INFO L225 Difference]: With dead ends: 55992 [2019-12-28 03:57:05,647 INFO L226 Difference]: Without dead ends: 55992 [2019-12-28 03:57:05,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:57:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55992 states. [2019-12-28 03:57:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55992 to 49593. [2019-12-28 03:57:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49593 states. [2019-12-28 03:57:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49593 states to 49593 states and 157329 transitions. [2019-12-28 03:57:09,577 INFO L78 Accepts]: Start accepts. Automaton has 49593 states and 157329 transitions. Word has length 79 [2019-12-28 03:57:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:09,578 INFO L462 AbstractCegarLoop]: Abstraction has 49593 states and 157329 transitions. [2019-12-28 03:57:09,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:57:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 49593 states and 157329 transitions. [2019-12-28 03:57:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-28 03:57:09,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:09,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:09,611 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:09,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1472851702, now seen corresponding path program 1 times [2019-12-28 03:57:09,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:09,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950138589] [2019-12-28 03:57:09,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:09,723 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-28 03:57:09,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950138589] [2019-12-28 03:57:09,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:09,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:57:09,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1102800374] [2019-12-28 03:57:09,724 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:09,764 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:09,805 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 183 transitions. [2019-12-28 03:57:09,805 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:09,806 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:09,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:57:09,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:09,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:57:09,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:57:09,807 INFO L87 Difference]: Start difference. First operand 49593 states and 157329 transitions. Second operand 8 states. [2019-12-28 03:57:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:12,005 INFO L93 Difference]: Finished difference Result 56799 states and 178120 transitions. [2019-12-28 03:57:12,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-28 03:57:12,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-12-28 03:57:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:12,173 INFO L225 Difference]: With dead ends: 56799 [2019-12-28 03:57:12,173 INFO L226 Difference]: Without dead ends: 56751 [2019-12-28 03:57:12,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-28 03:57:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56751 states. [2019-12-28 03:57:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56751 to 44460. [2019-12-28 03:57:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44460 states. [2019-12-28 03:57:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44460 states to 44460 states and 141688 transitions. [2019-12-28 03:57:13,642 INFO L78 Accepts]: Start accepts. Automaton has 44460 states and 141688 transitions. Word has length 79 [2019-12-28 03:57:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:13,643 INFO L462 AbstractCegarLoop]: Abstraction has 44460 states and 141688 transitions. [2019-12-28 03:57:13,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:57:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 44460 states and 141688 transitions. [2019-12-28 03:57:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 03:57:13,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:13,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:13,691 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:13,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1414672443, now seen corresponding path program 1 times [2019-12-28 03:57:13,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:13,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220739364] [2019-12-28 03:57:13,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:13,779 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-28 03:57:13,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220739364] [2019-12-28 03:57:13,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:13,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:57:13,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [111967838] [2019-12-28 03:57:13,780 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:13,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:13,863 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 90 transitions. [2019-12-28 03:57:13,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:13,864 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:13,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:57:13,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:13,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:57:13,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:57:13,867 INFO L87 Difference]: Start difference. First operand 44460 states and 141688 transitions. Second operand 3 states. [2019-12-28 03:57:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:14,470 INFO L93 Difference]: Finished difference Result 45984 states and 146029 transitions. [2019-12-28 03:57:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:57:14,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-28 03:57:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:14,565 INFO L225 Difference]: With dead ends: 45984 [2019-12-28 03:57:14,565 INFO L226 Difference]: Without dead ends: 45984 [2019-12-28 03:57:14,566 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-28 03:57:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45984 states. [2019-12-28 03:57:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45984 to 45180. [2019-12-28 03:57:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45180 states. [2019-12-28 03:57:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45180 states to 45180 states and 143754 transitions. [2019-12-28 03:57:15,730 INFO L78 Accepts]: Start accepts. Automaton has 45180 states and 143754 transitions. Word has length 80 [2019-12-28 03:57:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:15,730 INFO L462 AbstractCegarLoop]: Abstraction has 45180 states and 143754 transitions. [2019-12-28 03:57:15,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:57:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 45180 states and 143754 transitions. [2019-12-28 03:57:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:57:15,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:15,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:15,756 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1521989665, now seen corresponding path program 1 times [2019-12-28 03:57:15,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:15,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523172229] [2019-12-28 03:57:15,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:15,853 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-28 03:57:15,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523172229] [2019-12-28 03:57:15,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:15,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:57:15,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1559947871] [2019-12-28 03:57:15,854 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:15,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:15,895 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:57:15,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:15,896 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:15,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:57:15,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:15,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:57:15,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:57:15,897 INFO L87 Difference]: Start difference. First operand 45180 states and 143754 transitions. Second operand 7 states. [2019-12-28 03:57:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:17,539 INFO L93 Difference]: Finished difference Result 91592 states and 289557 transitions. [2019-12-28 03:57:17,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 03:57:17,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-12-28 03:57:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:17,717 INFO L225 Difference]: With dead ends: 91592 [2019-12-28 03:57:17,717 INFO L226 Difference]: Without dead ends: 91352 [2019-12-28 03:57:17,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:57:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91352 states. [2019-12-28 03:57:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91352 to 50959. [2019-12-28 03:57:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50959 states. [2019-12-28 03:57:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50959 states to 50959 states and 161075 transitions. [2019-12-28 03:57:19,217 INFO L78 Accepts]: Start accepts. Automaton has 50959 states and 161075 transitions. Word has length 82 [2019-12-28 03:57:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:19,218 INFO L462 AbstractCegarLoop]: Abstraction has 50959 states and 161075 transitions. [2019-12-28 03:57:19,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:57:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 50959 states and 161075 transitions. [2019-12-28 03:57:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:57:19,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:19,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:19,252 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:19,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:19,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1851755426, now seen corresponding path program 1 times [2019-12-28 03:57:19,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:19,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994245671] [2019-12-28 03:57:19,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:19,348 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-28 03:57:19,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994245671] [2019-12-28 03:57:19,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:19,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:57:19,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1267218460] [2019-12-28 03:57:19,349 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:19,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:19,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:57:19,404 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:19,405 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:19,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:57:19,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:19,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:57:19,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:57:19,406 INFO L87 Difference]: Start difference. First operand 50959 states and 161075 transitions. Second operand 6 states. [2019-12-28 03:57:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:21,190 INFO L93 Difference]: Finished difference Result 69497 states and 216709 transitions. [2019-12-28 03:57:21,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:57:21,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-12-28 03:57:21,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:21,325 INFO L225 Difference]: With dead ends: 69497 [2019-12-28 03:57:21,326 INFO L226 Difference]: Without dead ends: 69095 [2019-12-28 03:57:21,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:57:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69095 states. [2019-12-28 03:57:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69095 to 57563. [2019-12-28 03:57:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57563 states. [2019-12-28 03:57:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57563 states to 57563 states and 181582 transitions. [2019-12-28 03:57:22,300 INFO L78 Accepts]: Start accepts. Automaton has 57563 states and 181582 transitions. Word has length 82 [2019-12-28 03:57:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:22,300 INFO L462 AbstractCegarLoop]: Abstraction has 57563 states and 181582 transitions. [2019-12-28 03:57:22,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:57:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 57563 states and 181582 transitions. [2019-12-28 03:57:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:57:22,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:22,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:22,339 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash -890141409, now seen corresponding path program 1 times [2019-12-28 03:57:22,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:22,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069852345] [2019-12-28 03:57:22,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:22,432 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-28 03:57:22,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069852345] [2019-12-28 03:57:22,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:22,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:57:22,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979451183] [2019-12-28 03:57:22,434 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:22,450 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:22,491 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:57:22,492 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:22,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:22,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:57:22,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:22,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:57:22,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:57:22,494 INFO L87 Difference]: Start difference. First operand 57563 states and 181582 transitions. Second operand 7 states. [2019-12-28 03:57:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:24,561 INFO L93 Difference]: Finished difference Result 82928 states and 255685 transitions. [2019-12-28 03:57:24,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 03:57:24,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-12-28 03:57:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:24,699 INFO L225 Difference]: With dead ends: 82928 [2019-12-28 03:57:24,700 INFO L226 Difference]: Without dead ends: 82856 [2019-12-28 03:57:24,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:57:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82856 states. [2019-12-28 03:57:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82856 to 64098. [2019-12-28 03:57:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64098 states. [2019-12-28 03:57:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64098 states to 64098 states and 200126 transitions. [2019-12-28 03:57:26,089 INFO L78 Accepts]: Start accepts. Automaton has 64098 states and 200126 transitions. Word has length 82 [2019-12-28 03:57:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:26,089 INFO L462 AbstractCegarLoop]: Abstraction has 64098 states and 200126 transitions. [2019-12-28 03:57:26,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:57:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 64098 states and 200126 transitions. [2019-12-28 03:57:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:57:26,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:26,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:26,131 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:26,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:26,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1850294048, now seen corresponding path program 1 times [2019-12-28 03:57:26,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:26,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247719690] [2019-12-28 03:57:26,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:26,254 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-28 03:57:26,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247719690] [2019-12-28 03:57:26,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:26,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:57:26,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004682595] [2019-12-28 03:57:26,256 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:26,271 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:26,302 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:57:26,303 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:26,304 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:26,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:57:26,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:26,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:57:26,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:57:26,305 INFO L87 Difference]: Start difference. First operand 64098 states and 200126 transitions. Second operand 8 states. [2019-12-28 03:57:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:29,627 INFO L93 Difference]: Finished difference Result 84556 states and 259945 transitions. [2019-12-28 03:57:29,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 03:57:29,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-12-28 03:57:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:29,797 INFO L225 Difference]: With dead ends: 84556 [2019-12-28 03:57:29,797 INFO L226 Difference]: Without dead ends: 84253 [2019-12-28 03:57:29,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:57:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84253 states. [2019-12-28 03:57:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84253 to 60255. [2019-12-28 03:57:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60255 states. [2019-12-28 03:57:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60255 states to 60255 states and 187468 transitions. [2019-12-28 03:57:30,802 INFO L78 Accepts]: Start accepts. Automaton has 60255 states and 187468 transitions. Word has length 82 [2019-12-28 03:57:30,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:30,802 INFO L462 AbstractCegarLoop]: Abstraction has 60255 states and 187468 transitions. [2019-12-28 03:57:30,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:57:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 60255 states and 187468 transitions. [2019-12-28 03:57:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:57:30,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:30,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:30,847 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:30,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:30,847 INFO L82 PathProgramCache]: Analyzing trace with hash -238294750, now seen corresponding path program 1 times [2019-12-28 03:57:30,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:30,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627136389] [2019-12-28 03:57:30,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:30,958 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-28 03:57:30,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627136389] [2019-12-28 03:57:30,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:30,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:57:30,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1185622857] [2019-12-28 03:57:30,959 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:30,977 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:31,408 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:57:31,408 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:31,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:31,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:57:31,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:31,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:57:31,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:57:31,411 INFO L87 Difference]: Start difference. First operand 60255 states and 187468 transitions. Second operand 5 states. [2019-12-28 03:57:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:31,731 INFO L93 Difference]: Finished difference Result 81091 states and 256029 transitions. [2019-12-28 03:57:31,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:57:31,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-12-28 03:57:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:31,884 INFO L225 Difference]: With dead ends: 81091 [2019-12-28 03:57:31,885 INFO L226 Difference]: Without dead ends: 81091 [2019-12-28 03:57:31,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:57:32,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81091 states. [2019-12-28 03:57:32,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81091 to 47704. [2019-12-28 03:57:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47704 states. [2019-12-28 03:57:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47704 states to 47704 states and 148715 transitions. [2019-12-28 03:57:32,810 INFO L78 Accepts]: Start accepts. Automaton has 47704 states and 148715 transitions. Word has length 82 [2019-12-28 03:57:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:32,810 INFO L462 AbstractCegarLoop]: Abstraction has 47704 states and 148715 transitions. [2019-12-28 03:57:32,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:57:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 47704 states and 148715 transitions. [2019-12-28 03:57:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:57:33,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:33,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:33,176 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:33,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:33,177 INFO L82 PathProgramCache]: Analyzing trace with hash 242421666, now seen corresponding path program 1 times [2019-12-28 03:57:33,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:33,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252162821] [2019-12-28 03:57:33,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:33,318 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-28 03:57:33,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252162821] [2019-12-28 03:57:33,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:33,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:57:33,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [322660798] [2019-12-28 03:57:33,319 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:33,335 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:33,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:57:33,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:33,370 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:33,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:57:33,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:33,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:57:33,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:57:33,371 INFO L87 Difference]: Start difference. First operand 47704 states and 148715 transitions. Second operand 9 states. [2019-12-28 03:57:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:35,950 INFO L93 Difference]: Finished difference Result 66175 states and 202288 transitions. [2019-12-28 03:57:35,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 03:57:35,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-12-28 03:57:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:36,080 INFO L225 Difference]: With dead ends: 66175 [2019-12-28 03:57:36,081 INFO L226 Difference]: Without dead ends: 66175 [2019-12-28 03:57:36,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-28 03:57:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66175 states. [2019-12-28 03:57:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66175 to 56422. [2019-12-28 03:57:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56422 states. [2019-12-28 03:57:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56422 states to 56422 states and 175347 transitions. [2019-12-28 03:57:37,451 INFO L78 Accepts]: Start accepts. Automaton has 56422 states and 175347 transitions. Word has length 82 [2019-12-28 03:57:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:37,451 INFO L462 AbstractCegarLoop]: Abstraction has 56422 states and 175347 transitions. [2019-12-28 03:57:37,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:57:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 56422 states and 175347 transitions. [2019-12-28 03:57:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:57:37,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:37,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:37,486 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:37,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:37,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1487186147, now seen corresponding path program 1 times [2019-12-28 03:57:37,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:37,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761726969] [2019-12-28 03:57:37,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:37,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761726969] [2019-12-28 03:57:37,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:37,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:57:37,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [552353174] [2019-12-28 03:57:37,540 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:37,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:37,587 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:57:37,587 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:37,588 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:37,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:57:37,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:37,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:57:37,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:57:37,589 INFO L87 Difference]: Start difference. First operand 56422 states and 175347 transitions. Second operand 3 states. [2019-12-28 03:57:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:37,793 INFO L93 Difference]: Finished difference Result 44575 states and 137947 transitions. [2019-12-28 03:57:37,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:57:37,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-28 03:57:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:37,863 INFO L225 Difference]: With dead ends: 44575 [2019-12-28 03:57:37,863 INFO L226 Difference]: Without dead ends: 44497 [2019-12-28 03:57:37,864 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-28 03:57:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44497 states. [2019-12-28 03:57:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44497 to 43650. [2019-12-28 03:57:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43650 states. [2019-12-28 03:57:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43650 states to 43650 states and 135313 transitions. [2019-12-28 03:57:39,230 INFO L78 Accepts]: Start accepts. Automaton has 43650 states and 135313 transitions. Word has length 82 [2019-12-28 03:57:39,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:39,230 INFO L462 AbstractCegarLoop]: Abstraction has 43650 states and 135313 transitions. [2019-12-28 03:57:39,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:57:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 43650 states and 135313 transitions. [2019-12-28 03:57:39,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:57:39,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:39,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:39,252 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:39,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1028938358, now seen corresponding path program 1 times [2019-12-28 03:57:39,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:39,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329353226] [2019-12-28 03:57:39,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:39,350 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-28 03:57:39,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329353226] [2019-12-28 03:57:39,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:39,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:57:39,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1507947864] [2019-12-28 03:57:39,352 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:39,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:39,406 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 187 transitions. [2019-12-28 03:57:39,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:39,431 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:57:39,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:57:39,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:39,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:57:39,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:57:39,432 INFO L87 Difference]: Start difference. First operand 43650 states and 135313 transitions. Second operand 7 states. [2019-12-28 03:57:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:40,971 INFO L93 Difference]: Finished difference Result 71571 states and 220405 transitions. [2019-12-28 03:57:40,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:57:40,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-28 03:57:40,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:41,109 INFO L225 Difference]: With dead ends: 71571 [2019-12-28 03:57:41,109 INFO L226 Difference]: Without dead ends: 71493 [2019-12-28 03:57:41,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:57:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71493 states. [2019-12-28 03:57:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71493 to 59532. [2019-12-28 03:57:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59532 states. Received shutdown request... [2019-12-28 03:57:42,594 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-28 03:57:42,599 WARN L227 ceAbstractionStarter]: Timeout [2019-12-28 03:57:42,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:57:42 BasicIcfg [2019-12-28 03:57:42,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:57:42,602 INFO L168 Benchmark]: Toolchain (without parser) took 189704.16 ms. Allocated memory was 139.5 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 102.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-28 03:57:42,602 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-28 03:57:42,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.08 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.3 MB in the beginning and 157.0 MB in the end (delta: -54.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-28 03:57:42,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.20 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 154.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-28 03:57:42,604 INFO L168 Benchmark]: Boogie Preprocessor took 66.90 ms. Allocated memory is still 204.5 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-28 03:57:42,604 INFO L168 Benchmark]: RCFGBuilder took 1099.34 ms. Allocated memory is still 204.5 MB. Free memory was 151.3 MB in the beginning and 94.9 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2019-12-28 03:57:42,605 INFO L168 Benchmark]: TraceAbstraction took 187707.47 ms. Allocated memory was 204.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 94.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-28 03:57:42,608 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.17 ms. Allocated memory is still 139.5 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.08 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.3 MB in the beginning and 157.0 MB in the end (delta: -54.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.20 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 154.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.90 ms. Allocated memory is still 204.5 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1099.34 ms. Allocated memory is still 204.5 MB. Free memory was 151.3 MB in the beginning and 94.9 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 187707.47 ms. Allocated memory was 204.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 94.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while ReachableStatesComputation was computing reachable states (36433 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while ReachableStatesComputation was computing reachable states (36433 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: TIMEOUT, OverallTime: 187.5s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 68.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12848 SDtfs, 15361 SDslu, 32028 SDs, 0 SdLazy, 15837 SolverSat, 870 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 84 SyntacticMatches, 12 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310971occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 106.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 414799 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1539 NumberOfCodeBlocks, 1539 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1517 ConstructedInterpolants, 0 QuantifiedInterpolants, 249355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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