/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/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 05:39:20,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 05:39:20,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 05:39:20,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 05:39:20,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 05:39:20,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 05:39:20,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 05:39:20,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 05:39:20,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 05:39:20,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 05:39:20,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 05:39:20,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 05:39:20,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 05:39:20,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 05:39:20,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 05:39:20,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 05:39:20,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 05:39:20,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 05:39:20,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 05:39:20,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 05:39:20,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 05:39:20,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 05:39:20,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 05:39:20,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 05:39:20,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 05:39:20,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 05:39:20,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 05:39:20,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 05:39:20,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 05:39:20,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 05:39:20,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 05:39:20,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 05:39:20,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 05:39:20,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 05:39:20,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 05:39:20,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 05:39:20,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 05:39:20,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 05:39:20,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 05:39:20,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 05:39:20,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 05:39:20,107 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 05:39:20,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 05:39:20,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 05:39:20,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 05:39:20,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 05:39:20,122 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 05:39:20,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 05:39:20,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 05:39:20,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 05:39:20,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 05:39:20,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 05:39:20,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 05:39:20,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 05:39:20,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 05:39:20,124 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 05:39:20,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 05:39:20,125 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 05:39:20,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 05:39:20,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 05:39:20,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 05:39:20,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 05:39:20,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 05:39:20,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 05:39:20,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 05:39:20,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 05:39:20,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 05:39:20,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 05:39:20,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 05:39:20,127 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 05:39:20,127 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 05:39:20,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 05:39:20,128 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 05:39:20,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 05:39:20,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 05:39:20,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 05:39:20,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 05:39:20,405 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 05:39:20,406 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 05:39:20,407 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2019-12-28 05:39:20,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72559e560/6bd6fd025dac4d8fbdd994ef091da8a1/FLAGedc4f798b [2019-12-28 05:39:21,113 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 05:39:21,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2019-12-28 05:39:21,139 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72559e560/6bd6fd025dac4d8fbdd994ef091da8a1/FLAGedc4f798b [2019-12-28 05:39:21,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72559e560/6bd6fd025dac4d8fbdd994ef091da8a1 [2019-12-28 05:39:21,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 05:39:21,320 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 05:39:21,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 05:39:21,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 05:39:21,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 05:39:21,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:39:21" (1/1) ... [2019-12-28 05:39:21,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a576b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:21, skipping insertion in model container [2019-12-28 05:39:21,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:39:21" (1/1) ... [2019-12-28 05:39:21,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 05:39:21,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 05:39:22,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:39:22,260 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 05:39:22,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:39:22,840 INFO L208 MainTranslator]: Completed translation [2019-12-28 05:39:22,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:22 WrapperNode [2019-12-28 05:39:22,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 05:39:22,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 05:39:22,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 05:39:22,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 05:39:22,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:22" (1/1) ... [2019-12-28 05:39:22,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:22" (1/1) ... [2019-12-28 05:39:22,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 05:39:22,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 05:39:22,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 05:39:22,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 05:39:22,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:22" (1/1) ... [2019-12-28 05:39:22,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:22" (1/1) ... [2019-12-28 05:39:22,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:22" (1/1) ... [2019-12-28 05:39:22,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:22" (1/1) ... [2019-12-28 05:39:22,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:22" (1/1) ... [2019-12-28 05:39:22,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:22" (1/1) ... [2019-12-28 05:39:22,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:22" (1/1) ... [2019-12-28 05:39:22,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 05:39:22,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 05:39:22,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 05:39:22,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 05:39:22,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:22" (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 05:39:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 05:39:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-28 05:39:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-28 05:39:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-28 05:39:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 05:39:23,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 05:39:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-28 05:39:23,065 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-28 05:39:23,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 05:39:23,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 05:39:23,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-28 05:39:23,067 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 05:39:23,814 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 05:39:23,815 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-28 05:39:23,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:39:23 BoogieIcfgContainer [2019-12-28 05:39:23,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 05:39:23,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 05:39:23,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 05:39:23,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 05:39:23,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:39:21" (1/3) ... [2019-12-28 05:39:23,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8d1cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:39:23, skipping insertion in model container [2019-12-28 05:39:23,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:22" (2/3) ... [2019-12-28 05:39:23,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8d1cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:39:23, skipping insertion in model container [2019-12-28 05:39:23,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:39:23" (3/3) ... [2019-12-28 05:39:23,825 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2019-12-28 05:39:23,835 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 05:39:23,836 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 05:39:23,843 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-28 05:39:23,844 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 05:39:23,881 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,881 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,881 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,882 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,882 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,882 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,882 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,883 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,883 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,883 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,883 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,883 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,884 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,884 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,884 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,884 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,885 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,885 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,885 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,885 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,886 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,886 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,886 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,886 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,887 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,887 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,887 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,887 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,888 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,888 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,889 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,889 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,889 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,890 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,890 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,890 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,891 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,892 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,892 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,892 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,892 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,896 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,896 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,896 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,899 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,901 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,902 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,903 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,903 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,903 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,903 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,904 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,904 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,904 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,904 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,905 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,905 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,905 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,911 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,911 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,912 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,912 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,912 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,912 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,913 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,913 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,913 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,914 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,921 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,922 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,922 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,922 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,923 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,923 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,923 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,923 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,924 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,924 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:23,959 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-28 05:39:23,980 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 05:39:23,980 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 05:39:23,980 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 05:39:23,980 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 05:39:23,981 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 05:39:23,981 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 05:39:23,981 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 05:39:23,981 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 05:39:23,997 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 154 transitions [2019-12-28 05:39:24,312 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7540 states. [2019-12-28 05:39:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 7540 states. [2019-12-28 05:39:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-28 05:39:24,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:24,324 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] [2019-12-28 05:39:24,325 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:24,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:24,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1462968341, now seen corresponding path program 1 times [2019-12-28 05:39:24,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:24,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712812913] [2019-12-28 05:39:24,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:24,887 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 05:39:24,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712812913] [2019-12-28 05:39:24,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:24,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:39:24,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [175755046] [2019-12-28 05:39:24,891 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:24,899 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:24,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 32 transitions. [2019-12-28 05:39:24,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:24,926 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:39:24,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:39:24,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:24,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:39:24,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:39:24,944 INFO L87 Difference]: Start difference. First operand 7540 states. Second operand 6 states. [2019-12-28 05:39:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:25,385 INFO L93 Difference]: Finished difference Result 7543 states and 20986 transitions. [2019-12-28 05:39:25,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 05:39:25,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-28 05:39:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:25,446 INFO L225 Difference]: With dead ends: 7543 [2019-12-28 05:39:25,447 INFO L226 Difference]: Without dead ends: 6154 [2019-12-28 05:39:25,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-28 05:39:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6154 states. [2019-12-28 05:39:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6154 to 6153. [2019-12-28 05:39:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2019-12-28 05:39:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 17048 transitions. [2019-12-28 05:39:25,822 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 17048 transitions. Word has length 32 [2019-12-28 05:39:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:25,823 INFO L462 AbstractCegarLoop]: Abstraction has 6153 states and 17048 transitions. [2019-12-28 05:39:25,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:39:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 17048 transitions. [2019-12-28 05:39:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-28 05:39:25,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:25,824 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 05:39:25,825 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:25,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:25,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1084695127, now seen corresponding path program 1 times [2019-12-28 05:39:25,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:25,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726004939] [2019-12-28 05:39:25,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:25,984 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 05:39:25,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726004939] [2019-12-28 05:39:25,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:25,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:39:25,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1120911733] [2019-12-28 05:39:25,986 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:25,992 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:25,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 38 transitions. [2019-12-28 05:39:25,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:25,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:39:26,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:39:26,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:26,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:39:26,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:39:26,002 INFO L87 Difference]: Start difference. First operand 6153 states and 17048 transitions. Second operand 6 states. [2019-12-28 05:39:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:26,497 INFO L93 Difference]: Finished difference Result 6155 states and 17050 transitions. [2019-12-28 05:39:26,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:39:26,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-28 05:39:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:26,541 INFO L225 Difference]: With dead ends: 6155 [2019-12-28 05:39:26,541 INFO L226 Difference]: Without dead ends: 6155 [2019-12-28 05:39:26,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 05:39:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2019-12-28 05:39:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 6151. [2019-12-28 05:39:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6151 states. [2019-12-28 05:39:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6151 states to 6151 states and 17046 transitions. [2019-12-28 05:39:26,755 INFO L78 Accepts]: Start accepts. Automaton has 6151 states and 17046 transitions. Word has length 38 [2019-12-28 05:39:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:26,756 INFO L462 AbstractCegarLoop]: Abstraction has 6151 states and 17046 transitions. [2019-12-28 05:39:26,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:39:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 6151 states and 17046 transitions. [2019-12-28 05:39:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 05:39:26,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:26,760 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] [2019-12-28 05:39:26,760 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:26,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1692348281, now seen corresponding path program 1 times [2019-12-28 05:39:26,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:26,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375854676] [2019-12-28 05:39:26,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:26,952 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 05:39:26,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375854676] [2019-12-28 05:39:26,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:26,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:39:26,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [595648337] [2019-12-28 05:39:26,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:26,965 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:26,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-28 05:39:26,979 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:26,979 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:39:26,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:39:26,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:26,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:39:26,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:39:26,981 INFO L87 Difference]: Start difference. First operand 6151 states and 17046 transitions. Second operand 6 states. [2019-12-28 05:39:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:27,651 INFO L93 Difference]: Finished difference Result 9138 states and 25276 transitions. [2019-12-28 05:39:27,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 05:39:27,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-28 05:39:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:27,695 INFO L225 Difference]: With dead ends: 9138 [2019-12-28 05:39:27,696 INFO L226 Difference]: Without dead ends: 9138 [2019-12-28 05:39:27,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-12-28 05:39:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9138 states. [2019-12-28 05:39:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9138 to 6933. [2019-12-28 05:39:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6933 states. [2019-12-28 05:39:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6933 states to 6933 states and 19228 transitions. [2019-12-28 05:39:27,917 INFO L78 Accepts]: Start accepts. Automaton has 6933 states and 19228 transitions. Word has length 56 [2019-12-28 05:39:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:27,918 INFO L462 AbstractCegarLoop]: Abstraction has 6933 states and 19228 transitions. [2019-12-28 05:39:27,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:39:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 6933 states and 19228 transitions. [2019-12-28 05:39:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 05:39:27,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:27,924 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 05:39:27,924 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:27,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:27,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1330747333, now seen corresponding path program 1 times [2019-12-28 05:39:27,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:27,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591263380] [2019-12-28 05:39:27,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:28,076 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 05:39:28,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591263380] [2019-12-28 05:39:28,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:28,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:39:28,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1873672379] [2019-12-28 05:39:28,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:28,101 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:28,119 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 62 transitions. [2019-12-28 05:39:28,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:28,130 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:39:28,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:39:28,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:28,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:39:28,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:39:28,131 INFO L87 Difference]: Start difference. First operand 6933 states and 19228 transitions. Second operand 6 states. [2019-12-28 05:39:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:28,705 INFO L93 Difference]: Finished difference Result 9920 states and 27311 transitions. [2019-12-28 05:39:28,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 05:39:28,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-28 05:39:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:28,727 INFO L225 Difference]: With dead ends: 9920 [2019-12-28 05:39:28,728 INFO L226 Difference]: Without dead ends: 8303 [2019-12-28 05:39:28,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-28 05:39:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2019-12-28 05:39:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 8009. [2019-12-28 05:39:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8009 states. [2019-12-28 05:39:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8009 states to 8009 states and 22246 transitions. [2019-12-28 05:39:28,966 INFO L78 Accepts]: Start accepts. Automaton has 8009 states and 22246 transitions. Word has length 62 [2019-12-28 05:39:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:28,967 INFO L462 AbstractCegarLoop]: Abstraction has 8009 states and 22246 transitions. [2019-12-28 05:39:28,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:39:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 8009 states and 22246 transitions. [2019-12-28 05:39:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 05:39:28,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:28,975 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] [2019-12-28 05:39:28,976 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:28,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:28,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2008182927, now seen corresponding path program 1 times [2019-12-28 05:39:28,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:28,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104276689] [2019-12-28 05:39:28,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:29,071 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 05:39:29,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104276689] [2019-12-28 05:39:29,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:29,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:39:29,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1900598177] [2019-12-28 05:39:29,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:29,087 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:29,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 214 transitions. [2019-12-28 05:39:29,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:29,655 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-28 05:39:29,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-28 05:39:29,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:29,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-28 05:39:29,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-28 05:39:29,656 INFO L87 Difference]: Start difference. First operand 8009 states and 22246 transitions. Second operand 17 states. [2019-12-28 05:39:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:30,713 INFO L93 Difference]: Finished difference Result 3059 states and 8167 transitions. [2019-12-28 05:39:30,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 05:39:30,713 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2019-12-28 05:39:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:30,721 INFO L225 Difference]: With dead ends: 3059 [2019-12-28 05:39:30,721 INFO L226 Difference]: Without dead ends: 3059 [2019-12-28 05:39:30,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-12-28 05:39:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2019-12-28 05:39:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2795. [2019-12-28 05:39:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2795 states. [2019-12-28 05:39:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 7501 transitions. [2019-12-28 05:39:30,794 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 7501 transitions. Word has length 70 [2019-12-28 05:39:30,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:30,795 INFO L462 AbstractCegarLoop]: Abstraction has 2795 states and 7501 transitions. [2019-12-28 05:39:30,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-28 05:39:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 7501 transitions. [2019-12-28 05:39:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 05:39:30,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:30,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:39:30,803 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:30,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:30,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1769830359, now seen corresponding path program 1 times [2019-12-28 05:39:30,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:30,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171599377] [2019-12-28 05:39:30,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:31,978 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-12-28 05:39:32,344 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 05:39:32,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171599377] [2019-12-28 05:39:32,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:32,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-28 05:39:32,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1753118205] [2019-12-28 05:39:32,346 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:32,383 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:33,483 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 754 states and 1785 transitions. [2019-12-28 05:39:33,483 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:33,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-28 05:39:33,547 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,551 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,560 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-28 05:39:33,581 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:33,583 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-12-28 05:39:33,583 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:68, output treesize:25 [2019-12-28 05:39:33,645 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,650 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,655 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,661 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,666 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:33,741 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,746 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,751 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,757 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,760 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,780 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:33,781 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-28 05:39:33,781 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:235, output treesize:30 [2019-12-28 05:39:33,938 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,942 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,946 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:33,952 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:34,005 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:34,009 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:34,013 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:34,017 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:34,022 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:34,043 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:34,043 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-28 05:39:34,044 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:178, output treesize:14 [2019-12-28 05:39:34,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-28 05:39:35,609 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 65 times. [2019-12-28 05:39:35,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-28 05:39:35,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:35,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-28 05:39:35,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2019-12-28 05:39:35,610 INFO L87 Difference]: Start difference. First operand 2795 states and 7501 transitions. Second operand 28 states. [2019-12-28 05:39:36,850 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-12-28 05:39:37,201 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-12-28 05:39:37,601 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-28 05:39:38,227 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-12-28 05:39:38,944 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-12-28 05:39:39,215 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2019-12-28 05:39:39,587 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-28 05:39:40,046 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2019-12-28 05:39:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:41,363 INFO L93 Difference]: Finished difference Result 4551 states and 12261 transitions. [2019-12-28 05:39:41,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-28 05:39:41,363 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 103 [2019-12-28 05:39:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:41,374 INFO L225 Difference]: With dead ends: 4551 [2019-12-28 05:39:41,374 INFO L226 Difference]: Without dead ends: 4551 [2019-12-28 05:39:41,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 11 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=511, Invalid=1939, Unknown=0, NotChecked=0, Total=2450 [2019-12-28 05:39:41,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2019-12-28 05:39:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 3320. [2019-12-28 05:39:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3320 states. [2019-12-28 05:39:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 8797 transitions. [2019-12-28 05:39:41,456 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 8797 transitions. Word has length 103 [2019-12-28 05:39:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:41,456 INFO L462 AbstractCegarLoop]: Abstraction has 3320 states and 8797 transitions. [2019-12-28 05:39:41,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-28 05:39:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 8797 transitions. [2019-12-28 05:39:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 05:39:41,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:41,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:39:41,467 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:41,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1494462625, now seen corresponding path program 2 times [2019-12-28 05:39:41,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:41,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280234436] [2019-12-28 05:39:41,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:42,476 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 05:39:42,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280234436] [2019-12-28 05:39:42,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:42,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-28 05:39:42,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1687872325] [2019-12-28 05:39:42,477 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:42,510 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:42,934 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 564 states and 1231 transitions. [2019-12-28 05:39:42,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:42,937 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 05:39:42,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-28 05:39:42,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:42,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-28 05:39:42,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-28 05:39:42,938 INFO L87 Difference]: Start difference. First operand 3320 states and 8797 transitions. Second operand 15 states. [2019-12-28 05:39:44,209 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-12-28 05:39:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:44,572 INFO L93 Difference]: Finished difference Result 3740 states and 9841 transitions. [2019-12-28 05:39:44,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-28 05:39:44,573 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 103 [2019-12-28 05:39:44,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:44,581 INFO L225 Difference]: With dead ends: 3740 [2019-12-28 05:39:44,581 INFO L226 Difference]: Without dead ends: 3740 [2019-12-28 05:39:44,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2019-12-28 05:39:44,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2019-12-28 05:39:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3476. [2019-12-28 05:39:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2019-12-28 05:39:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 9175 transitions. [2019-12-28 05:39:44,656 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 9175 transitions. Word has length 103 [2019-12-28 05:39:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:44,656 INFO L462 AbstractCegarLoop]: Abstraction has 3476 states and 9175 transitions. [2019-12-28 05:39:44,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-28 05:39:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 9175 transitions. [2019-12-28 05:39:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 05:39:44,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:44,665 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:44,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:44,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1558591235, now seen corresponding path program 1 times [2019-12-28 05:39:44,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:44,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388389617] [2019-12-28 05:39:44,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:45,169 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 05:39:45,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388389617] [2019-12-28 05:39:45,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:45,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-28 05:39:45,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [593289244] [2019-12-28 05:39:45,171 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:45,201 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:46,684 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 1002 states and 2491 transitions. [2019-12-28 05:39:46,685 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:46,715 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:46,720 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:46,723 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:46,724 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:46,725 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-28 05:39:46,725 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:1 [2019-12-28 05:39:46,843 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-28 05:39:46,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-28 05:39:46,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:46,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-28 05:39:46,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-28 05:39:46,845 INFO L87 Difference]: Start difference. First operand 3476 states and 9175 transitions. Second operand 16 states. [2019-12-28 05:39:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:48,850 INFO L93 Difference]: Finished difference Result 4389 states and 11579 transitions. [2019-12-28 05:39:48,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-28 05:39:48,850 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-12-28 05:39:48,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:48,859 INFO L225 Difference]: With dead ends: 4389 [2019-12-28 05:39:48,860 INFO L226 Difference]: Without dead ends: 4389 [2019-12-28 05:39:48,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=353, Invalid=769, Unknown=0, NotChecked=0, Total=1122 [2019-12-28 05:39:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4389 states. [2019-12-28 05:39:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4389 to 3582. [2019-12-28 05:39:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3582 states. [2019-12-28 05:39:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 9371 transitions. [2019-12-28 05:39:48,950 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 9371 transitions. Word has length 103 [2019-12-28 05:39:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:48,951 INFO L462 AbstractCegarLoop]: Abstraction has 3582 states and 9371 transitions. [2019-12-28 05:39:48,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-28 05:39:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 9371 transitions. [2019-12-28 05:39:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 05:39:48,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:48,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:39:48,961 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:48,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:48,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1403153183, now seen corresponding path program 3 times [2019-12-28 05:39:48,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:48,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715205357] [2019-12-28 05:39:48,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:49,734 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 05:39:49,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715205357] [2019-12-28 05:39:49,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:49,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-28 05:39:49,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [652843882] [2019-12-28 05:39:49,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:49,762 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:50,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 1012 states and 2511 transitions. [2019-12-28 05:39:50,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:50,712 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,715 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,718 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,720 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,763 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:50,767 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,769 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,773 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,775 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:50,789 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-28 05:39:50,789 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:178, output treesize:14 [2019-12-28 05:39:50,911 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,914 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,918 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,924 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,967 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:50,971 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,973 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,977 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,978 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:50,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:50,994 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-28 05:39:50,994 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:178, output treesize:14 [2019-12-28 05:39:51,055 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:51,058 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:51,062 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:51,065 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:51,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:51,124 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:51,128 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:51,132 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:51,135 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:51,177 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:51,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-28 05:39:51,177 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:210, output treesize:50 [2019-12-28 05:39:51,783 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-28 05:39:51,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-28 05:39:51,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:51,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-28 05:39:51,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2019-12-28 05:39:51,785 INFO L87 Difference]: Start difference. First operand 3582 states and 9371 transitions. Second operand 26 states. [2019-12-28 05:39:52,714 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2019-12-28 05:39:52,888 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-12-28 05:39:53,730 WARN L192 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-12-28 05:39:54,015 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-12-28 05:39:54,250 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-12-28 05:39:54,618 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-12-28 05:39:54,902 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-12-28 05:39:55,138 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-12-28 05:39:55,621 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2019-12-28 05:39:55,860 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-12-28 05:39:56,094 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-28 05:39:56,353 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-12-28 05:39:56,621 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-12-28 05:39:57,115 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-28 05:39:57,315 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-12-28 05:39:57,863 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 57 [2019-12-28 05:39:58,171 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-12-28 05:39:58,439 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-12-28 05:39:58,904 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 73 [2019-12-28 05:39:59,221 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-12-28 05:39:59,571 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2019-12-28 05:39:59,901 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-12-28 05:40:00,236 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-28 05:40:01,269 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2019-12-28 05:40:01,470 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-12-28 05:40:01,607 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 31 [2019-12-28 05:40:01,765 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2019-12-28 05:40:01,986 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-12-28 05:40:02,195 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2019-12-28 05:40:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:40:02,207 INFO L93 Difference]: Finished difference Result 7547 states and 19873 transitions. [2019-12-28 05:40:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-28 05:40:02,208 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2019-12-28 05:40:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:40:02,218 INFO L225 Difference]: With dead ends: 7547 [2019-12-28 05:40:02,218 INFO L226 Difference]: Without dead ends: 7547 [2019-12-28 05:40:02,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=896, Invalid=3010, Unknown=0, NotChecked=0, Total=3906 [2019-12-28 05:40:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7547 states. [2019-12-28 05:40:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7547 to 3796. [2019-12-28 05:40:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3796 states. [2019-12-28 05:40:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 9909 transitions. [2019-12-28 05:40:02,333 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 9909 transitions. Word has length 103 [2019-12-28 05:40:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:40:02,333 INFO L462 AbstractCegarLoop]: Abstraction has 3796 states and 9909 transitions. [2019-12-28 05:40:02,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-28 05:40:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 9909 transitions. [2019-12-28 05:40:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 05:40:02,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:40:02,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:40:02,342 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:40:02,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:40:02,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1031749795, now seen corresponding path program 4 times [2019-12-28 05:40:02,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:40:02,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069756886] [2019-12-28 05:40:02,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:40:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:40:02,997 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 05:40:02,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069756886] [2019-12-28 05:40:02,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:40:02,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-28 05:40:02,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1771486435] [2019-12-28 05:40:02,999 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:40:03,022 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:40:04,007 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 767 states and 1853 transitions. [2019-12-28 05:40:04,007 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:40:04,165 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:04,169 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:04,171 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:04,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:04,173 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-28 05:40:04,173 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:1 [2019-12-28 05:40:04,317 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-28 05:40:04,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-28 05:40:04,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:40:04,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-28 05:40:04,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-12-28 05:40:04,319 INFO L87 Difference]: Start difference. First operand 3796 states and 9909 transitions. Second operand 21 states. [2019-12-28 05:40:06,546 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2019-12-28 05:40:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:40:07,215 INFO L93 Difference]: Finished difference Result 4482 states and 11453 transitions. [2019-12-28 05:40:07,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-28 05:40:07,215 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2019-12-28 05:40:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:40:07,221 INFO L225 Difference]: With dead ends: 4482 [2019-12-28 05:40:07,221 INFO L226 Difference]: Without dead ends: 4482 [2019-12-28 05:40:07,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=363, Invalid=1529, Unknown=0, NotChecked=0, Total=1892 [2019-12-28 05:40:07,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2019-12-28 05:40:07,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 3796. [2019-12-28 05:40:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3796 states. [2019-12-28 05:40:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 9819 transitions. [2019-12-28 05:40:07,294 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 9819 transitions. Word has length 103 [2019-12-28 05:40:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:40:07,294 INFO L462 AbstractCegarLoop]: Abstraction has 3796 states and 9819 transitions. [2019-12-28 05:40:07,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-28 05:40:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 9819 transitions. [2019-12-28 05:40:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 05:40:07,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:40:07,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:40:07,303 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:40:07,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:40:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash 328612199, now seen corresponding path program 5 times [2019-12-28 05:40:07,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:40:07,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974687110] [2019-12-28 05:40:07,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:40:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:40:07,895 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 05:40:07,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974687110] [2019-12-28 05:40:07,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:40:07,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-28 05:40:07,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1626087492] [2019-12-28 05:40:07,897 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:40:07,918 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:40:08,363 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 643 states and 1490 transitions. [2019-12-28 05:40:08,363 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:40:08,654 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:08,659 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:08,663 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:08,666 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:08,669 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:08,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:08,730 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:08,733 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:08,735 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:08,738 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:08,740 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:08,756 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:08,756 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-28 05:40:08,757 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:185, output treesize:20 [2019-12-28 05:40:08,758 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-28 05:40:08,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-28 05:40:08,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:40:08,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-28 05:40:08,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-28 05:40:08,759 INFO L87 Difference]: Start difference. First operand 3796 states and 9819 transitions. Second operand 17 states. [2019-12-28 05:40:10,117 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-12-28 05:40:10,313 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2019-12-28 05:40:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:40:10,600 INFO L93 Difference]: Finished difference Result 2717 states and 6790 transitions. [2019-12-28 05:40:10,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 05:40:10,600 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-12-28 05:40:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:40:10,603 INFO L225 Difference]: With dead ends: 2717 [2019-12-28 05:40:10,603 INFO L226 Difference]: Without dead ends: 2717 [2019-12-28 05:40:10,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2019-12-28 05:40:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2019-12-28 05:40:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2553. [2019-12-28 05:40:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-28 05:40:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 6400 transitions. [2019-12-28 05:40:10,646 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 6400 transitions. Word has length 103 [2019-12-28 05:40:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:40:10,646 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 6400 transitions. [2019-12-28 05:40:10,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-28 05:40:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 6400 transitions. [2019-12-28 05:40:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 05:40:10,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:40:10,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:40:10,652 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:40:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:40:10,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1701464623, now seen corresponding path program 6 times [2019-12-28 05:40:10,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:40:10,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318337905] [2019-12-28 05:40:10,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:40:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:40:11,448 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 05:40:11,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318337905] [2019-12-28 05:40:11,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:40:11,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-28 05:40:11,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [950334810] [2019-12-28 05:40:11,449 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:40:11,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:40:12,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 1051 states and 2633 transitions. [2019-12-28 05:40:12,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:40:12,401 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,404 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,406 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,408 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:12,456 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,459 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,461 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,463 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,476 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:12,476 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-28 05:40:12,476 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:180, output treesize:16 [2019-12-28 05:40:12,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-28 05:40:12,735 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,739 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,743 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,746 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:12,802 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,806 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,810 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,813 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:12,828 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-28 05:40:12,829 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:178, output treesize:14 [2019-12-28 05:40:12,835 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,839 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,843 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,847 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,895 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:12,898 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,901 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,904 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,908 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,922 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:12,922 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-28 05:40:12,923 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:180, output treesize:16 [2019-12-28 05:40:12,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,988 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,992 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,996 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:13,086 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,090 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,094 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,097 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:13,174 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-12-28 05:40:13,175 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:222, output treesize:62 [2019-12-28 05:40:13,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,323 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,325 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,328 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:13,380 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,383 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,386 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,388 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,401 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:13,401 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-28 05:40:13,401 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:178, output treesize:14 [2019-12-28 05:40:13,608 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,611 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,616 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,620 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:13,712 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,716 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,719 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,722 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:13,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:13,793 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-12-28 05:40:13,793 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:222, output treesize:62 [2019-12-28 05:40:14,352 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,356 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,361 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,365 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,467 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-28 05:40:14,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:14,474 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,479 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,483 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,485 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,552 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:14,554 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-12-28 05:40:14,554 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:238, output treesize:78 [2019-12-28 05:40:15,287 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,292 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,297 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,302 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,448 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-28 05:40:15,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:15,453 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,458 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,463 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,467 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,584 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-28 05:40:15,584 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:15,585 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-12-28 05:40:15,586 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:238, output treesize:78 [2019-12-28 05:40:15,596 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,601 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,606 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,611 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,727 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-28 05:40:15,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:15,731 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,735 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,740 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,743 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:15,823 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-12-28 05:40:15,823 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:238, output treesize:78 [2019-12-28 05:40:16,035 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,040 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,044 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,049 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:16,154 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,159 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,162 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,166 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,241 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:16,242 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-12-28 05:40:16,243 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:238, output treesize:78 [2019-12-28 05:40:16,347 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,352 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,358 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,363 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,533 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-28 05:40:16,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:16,540 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,547 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,554 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,560 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,686 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-28 05:40:16,686 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:16,688 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-12-28 05:40:16,688 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:238, output treesize:78 [2019-12-28 05:40:17,047 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-28 05:40:17,431 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-28 05:40:17,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:17,455 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:17,464 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:17,472 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:17,659 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-28 05:40:17,659 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:17,667 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:17,674 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:17,681 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:17,687 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:17,833 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-28 05:40:17,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:17,835 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-12-28 05:40:17,835 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:238, output treesize:78 [2019-12-28 05:40:18,215 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-28 05:40:18,629 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-28 05:40:18,899 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-28 05:40:19,540 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-28 05:40:19,789 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:19,799 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:19,809 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:19,814 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:19,922 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-28 05:40:19,923 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:19,926 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:19,930 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:19,935 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:19,938 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:20,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:20,011 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-12-28 05:40:20,011 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:230, output treesize:102 [2019-12-28 05:40:20,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 95 times. [2019-12-28 05:40:20,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-28 05:40:20,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:40:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-28 05:40:20,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1508, Unknown=0, NotChecked=0, Total=1640 [2019-12-28 05:40:20,014 INFO L87 Difference]: Start difference. First operand 2553 states and 6400 transitions. Second operand 41 states. [2019-12-28 05:40:21,442 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-12-28 05:40:21,974 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2019-12-28 05:40:22,395 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-28 05:40:22,775 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2019-12-28 05:40:23,232 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-28 05:40:23,683 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-28 05:40:24,982 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-12-28 05:40:25,198 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-12-28 05:40:25,597 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 42 [2019-12-28 05:40:25,866 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-12-28 05:40:26,190 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-12-28 05:40:26,402 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-12-28 05:40:26,682 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-12-28 05:40:27,052 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-12-28 05:40:28,067 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-12-28 05:40:28,361 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-12-28 05:40:28,619 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-12-28 05:40:28,810 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-28 05:40:29,026 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-12-28 05:40:29,316 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-12-28 05:40:29,601 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-12-28 05:40:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:40:29,624 INFO L93 Difference]: Finished difference Result 3133 states and 7818 transitions. [2019-12-28 05:40:29,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-28 05:40:29,625 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 103 [2019-12-28 05:40:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:40:29,628 INFO L225 Difference]: With dead ends: 3133 [2019-12-28 05:40:29,629 INFO L226 Difference]: Without dead ends: 3133 [2019-12-28 05:40:29,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 62 SyntacticMatches, 12 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=814, Invalid=3742, Unknown=0, NotChecked=0, Total=4556 [2019-12-28 05:40:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2019-12-28 05:40:29,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 2364. [2019-12-28 05:40:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-12-28 05:40:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 6042 transitions. [2019-12-28 05:40:29,677 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 6042 transitions. Word has length 103 [2019-12-28 05:40:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:40:29,677 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 6042 transitions. [2019-12-28 05:40:29,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-28 05:40:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 6042 transitions. [2019-12-28 05:40:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-28 05:40:29,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:40:29,684 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, 1, 1, 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 05:40:29,684 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:40:29,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:40:29,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1081092433, now seen corresponding path program 1 times [2019-12-28 05:40:29,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:40:29,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588141325] [2019-12-28 05:40:29,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:40:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:40:31,886 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 05:40:31,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588141325] [2019-12-28 05:40:31,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:40:31,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-12-28 05:40:31,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [762281670] [2019-12-28 05:40:31,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:40:31,902 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:40:32,442 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 760 states and 1791 transitions. [2019-12-28 05:40:32,442 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:40:32,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-28 05:40:32,449 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,451 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,454 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-28 05:40:32,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:32,466 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-12-28 05:40:32,466 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:68, output treesize:25 [2019-12-28 05:40:32,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,582 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,586 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,590 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,595 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,599 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,672 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:32,675 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,677 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,680 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,683 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,685 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,687 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:32,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:32,709 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-12-28 05:40:32,709 INFO L239 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:280, output treesize:34 [2019-12-28 05:40:33,025 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:33,028 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:33,032 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:33,036 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:33,045 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:33,048 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:33,117 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:33,122 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:33,124 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:33,128 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:33,132 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:33,135 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:33,137 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:33,157 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:33,157 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-12-28 05:40:33,157 INFO L239 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:296, output treesize:50 [2019-12-28 05:40:33,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-28 05:40:35,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 83 times. [2019-12-28 05:40:35,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-28 05:40:35,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:40:35,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-28 05:40:35,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-12-28 05:40:35,185 INFO L87 Difference]: Start difference. First operand 2364 states and 6042 transitions. Second operand 41 states. [2019-12-28 05:40:36,539 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-12-28 05:40:36,896 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-12-28 05:40:37,159 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-12-28 05:40:37,536 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-12-28 05:40:38,010 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-12-28 05:40:38,298 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-12-28 05:40:38,724 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-12-28 05:40:39,114 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-12-28 05:40:39,342 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-12-28 05:40:39,711 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 67 [2019-12-28 05:40:39,958 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-12-28 05:40:40,328 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-12-28 05:40:40,706 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 73 [2019-12-28 05:40:40,981 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-12-28 05:40:41,723 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2019-12-28 05:40:42,306 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-12-28 05:40:42,644 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-12-28 05:40:43,031 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 75 [2019-12-28 05:40:43,457 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2019-12-28 05:40:43,810 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-12-28 05:40:44,104 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-12-28 05:40:44,466 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 96 [2019-12-28 05:40:44,840 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-28 05:40:45,182 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 70 [2019-12-28 05:40:45,569 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2019-12-28 05:40:45,878 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-12-28 05:40:46,400 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-12-28 05:40:47,141 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-12-28 05:40:47,556 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-12-28 05:40:47,938 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-28 05:40:48,253 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-28 05:40:48,708 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-28 05:40:48,957 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-12-28 05:40:49,213 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-12-28 05:40:49,729 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-12-28 05:40:50,141 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 63 [2019-12-28 05:40:50,554 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-12-28 05:40:50,920 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 63 [2019-12-28 05:40:51,245 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 67 [2019-12-28 05:40:51,738 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 94 [2019-12-28 05:40:52,068 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-12-28 05:40:52,410 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-12-28 05:40:52,858 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 92 [2019-12-28 05:40:53,398 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 71 [2019-12-28 05:40:53,733 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 86 [2019-12-28 05:40:54,033 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-12-28 05:40:54,568 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 67 [2019-12-28 05:40:54,989 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 88 [2019-12-28 05:40:55,220 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-12-28 05:40:55,527 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-28 05:40:55,925 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-28 05:40:56,489 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-12-28 05:40:57,749 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-28 05:40:57,892 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-28 05:40:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:40:57,934 INFO L93 Difference]: Finished difference Result 3618 states and 8919 transitions. [2019-12-28 05:40:57,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-28 05:40:57,934 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 109 [2019-12-28 05:40:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:40:57,937 INFO L225 Difference]: With dead ends: 3618 [2019-12-28 05:40:57,937 INFO L226 Difference]: Without dead ends: 2708 [2019-12-28 05:40:57,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 62 SyntacticMatches, 12 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2644 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=1628, Invalid=9502, Unknown=0, NotChecked=0, Total=11130 [2019-12-28 05:40:57,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2019-12-28 05:40:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2280. [2019-12-28 05:40:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-12-28 05:40:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 5753 transitions. [2019-12-28 05:40:57,980 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 5753 transitions. Word has length 109 [2019-12-28 05:40:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:40:57,981 INFO L462 AbstractCegarLoop]: Abstraction has 2280 states and 5753 transitions. [2019-12-28 05:40:57,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-28 05:40:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 5753 transitions. [2019-12-28 05:40:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-28 05:40:57,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:40:57,987 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, 1, 1, 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 05:40:57,987 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:40:57,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:40:57,987 INFO L82 PathProgramCache]: Analyzing trace with hash -162857477, now seen corresponding path program 2 times [2019-12-28 05:40:57,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:40:57,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030567491] [2019-12-28 05:40:57,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:40:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:41:00,176 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 05:41:00,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030567491] [2019-12-28 05:41:00,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:41:00,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-12-28 05:41:00,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [905643303] [2019-12-28 05:41:00,177 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:41:00,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:41:00,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 811 states and 1937 transitions. [2019-12-28 05:41:00,730 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:41:00,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-28 05:41:00,892 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-28 05:41:00,895 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,898 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:00,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-12-28 05:41:00,912 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:68, output treesize:25 [2019-12-28 05:41:00,985 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,989 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,991 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,995 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,997 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:01,060 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,063 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,068 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,070 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,072 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,090 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:01,090 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-28 05:41:01,090 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:235, output treesize:30 [2019-12-28 05:41:01,403 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,407 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,411 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,415 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,418 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:01,487 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,491 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,494 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,497 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,499 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,516 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:01,517 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-28 05:41:01,517 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:251, output treesize:46 [2019-12-28 05:41:01,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-28 05:41:01,737 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,740 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,744 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,747 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,751 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,812 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:01,815 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,819 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,822 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,825 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,828 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:01,848 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-28 05:41:01,849 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:246, output treesize:41 [2019-12-28 05:41:03,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,419 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,424 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,429 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,441 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,530 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:03,534 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,537 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,541 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,545 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,559 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,623 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:03,624 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-28 05:41:03,624 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:345, output treesize:145 [2019-12-28 05:41:03,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,911 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,921 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,926 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:03,931 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:04,051 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-28 05:41:04,052 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:04,056 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:04,059 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:04,063 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:04,068 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:04,071 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:04,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:04,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-28 05:41:04,134 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:357, output treesize:157 [2019-12-28 05:41:04,937 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 88 times. [2019-12-28 05:41:04,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-28 05:41:04,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:41:04,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-28 05:41:04,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1942, Unknown=0, NotChecked=0, Total=2070 [2019-12-28 05:41:04,939 INFO L87 Difference]: Start difference. First operand 2280 states and 5753 transitions. Second operand 46 states. [2019-12-28 05:41:07,317 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-28 05:41:07,681 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-28 05:41:08,011 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-12-28 05:41:08,332 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-12-28 05:41:08,608 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-28 05:41:08,900 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-12-28 05:41:09,378 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-12-28 05:41:09,891 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-12-28 05:41:10,432 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-12-28 05:41:11,008 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-12-28 05:41:11,373 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 67 [2019-12-28 05:41:11,772 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2019-12-28 05:41:12,119 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 61 [2019-12-28 05:41:12,563 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-28 05:41:12,844 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 59 [2019-12-28 05:41:13,145 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-12-28 05:41:14,229 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2019-12-28 05:41:14,565 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 61 [2019-12-28 05:41:14,864 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-12-28 05:41:15,155 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2019-12-28 05:41:15,673 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-12-28 05:41:15,900 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-12-28 05:41:16,135 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-12-28 05:41:16,587 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-12-28 05:41:16,907 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 45 [2019-12-28 05:41:17,459 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 58 [2019-12-28 05:41:17,862 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 49 [2019-12-28 05:41:18,355 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-12-28 05:41:18,808 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 62 [2019-12-28 05:41:19,280 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 60 [2019-12-28 05:41:19,951 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-12-28 05:41:20,441 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 62 [2019-12-28 05:41:20,805 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-28 05:41:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:41:22,539 INFO L93 Difference]: Finished difference Result 3322 states and 8266 transitions. [2019-12-28 05:41:22,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-28 05:41:22,540 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 109 [2019-12-28 05:41:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:41:22,544 INFO L225 Difference]: With dead ends: 3322 [2019-12-28 05:41:22,544 INFO L226 Difference]: Without dead ends: 2610 [2019-12-28 05:41:22,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=1162, Invalid=8150, Unknown=0, NotChecked=0, Total=9312 [2019-12-28 05:41:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2019-12-28 05:41:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2278. [2019-12-28 05:41:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2019-12-28 05:41:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 5749 transitions. [2019-12-28 05:41:22,585 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 5749 transitions. Word has length 109 [2019-12-28 05:41:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:41:22,585 INFO L462 AbstractCegarLoop]: Abstraction has 2278 states and 5749 transitions. [2019-12-28 05:41:22,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-28 05:41:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 5749 transitions. [2019-12-28 05:41:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-28 05:41:22,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:41:22,591 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, 1, 1, 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 05:41:22,591 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:41:22,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:41:22,591 INFO L82 PathProgramCache]: Analyzing trace with hash -623005871, now seen corresponding path program 3 times [2019-12-28 05:41:22,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:41:22,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052048482] [2019-12-28 05:41:22,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:41:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:41:25,050 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 05:41:25,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052048482] [2019-12-28 05:41:25,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:41:25,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-12-28 05:41:25,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1739518245] [2019-12-28 05:41:25,050 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:41:25,065 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:41:25,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 296 states and 529 transitions. [2019-12-28 05:41:25,239 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:41:25,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-12-28 05:41:27,287 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-28 05:41:27,569 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-28 05:41:27,965 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-28 05:41:28,264 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-28 05:41:28,763 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-28 05:41:29,077 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-28 05:41:29,386 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-28 05:41:29,875 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-28 05:41:30,295 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-28 05:41:30,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 51 times. [2019-12-28 05:41:30,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-28 05:41:30,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:41:30,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-28 05:41:30,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2220, Unknown=0, NotChecked=0, Total=2352 [2019-12-28 05:41:30,312 INFO L87 Difference]: Start difference. First operand 2278 states and 5749 transitions. Second operand 49 states. [2019-12-28 05:41:33,052 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-12-28 05:41:33,332 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-12-28 05:41:34,408 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 63 [2019-12-28 05:41:34,722 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-12-28 05:41:35,344 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-28 05:41:36,508 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 67 [2019-12-28 05:41:37,395 WARN L192 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 70 [2019-12-28 05:41:37,993 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 95 [2019-12-28 05:41:38,547 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 89 [2019-12-28 05:41:39,325 WARN L192 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 101 [2019-12-28 05:41:40,043 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-12-28 05:41:40,832 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-28 05:41:41,330 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 56 [2019-12-28 05:41:41,732 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-12-28 05:41:42,368 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 52 [2019-12-28 05:41:42,873 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-28 05:41:43,458 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 60 [2019-12-28 05:41:44,267 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 64 [2019-12-28 05:41:44,704 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 56 [2019-12-28 05:41:45,142 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 50 [2019-12-28 05:41:45,547 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 46 [2019-12-28 05:41:46,002 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 60 [2019-12-28 05:41:46,470 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 54 [2019-12-28 05:41:46,733 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-12-28 05:41:47,207 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-28 05:41:47,957 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-12-28 05:41:48,443 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-28 05:41:48,718 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-28 05:41:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:41:50,470 INFO L93 Difference]: Finished difference Result 2949 states and 7160 transitions. [2019-12-28 05:41:50,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-28 05:41:50,470 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 109 [2019-12-28 05:41:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:41:50,474 INFO L225 Difference]: With dead ends: 2949 [2019-12-28 05:41:50,474 INFO L226 Difference]: Without dead ends: 2642 [2019-12-28 05:41:50,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 27 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=1065, Invalid=7125, Unknown=0, NotChecked=0, Total=8190 [2019-12-28 05:41:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2019-12-28 05:41:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2398. [2019-12-28 05:41:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2398 states. [2019-12-28 05:41:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 6022 transitions. [2019-12-28 05:41:50,512 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 6022 transitions. Word has length 109 [2019-12-28 05:41:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:41:50,512 INFO L462 AbstractCegarLoop]: Abstraction has 2398 states and 6022 transitions. [2019-12-28 05:41:50,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-28 05:41:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 6022 transitions. [2019-12-28 05:41:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-28 05:41:50,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:41:50,518 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, 1, 1, 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 05:41:50,518 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:41:50,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:41:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash 753633963, now seen corresponding path program 4 times [2019-12-28 05:41:50,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:41:50,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226859171] [2019-12-28 05:41:50,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:41:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:41:51,232 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2019-12-28 05:41:52,978 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 05:41:52,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226859171] [2019-12-28 05:41:52,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:41:52,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-12-28 05:41:52,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1349994372] [2019-12-28 05:41:52,979 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:41:52,999 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:41:53,481 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 663 states and 1543 transitions. [2019-12-28 05:41:53,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:41:54,747 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:54,751 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:54,754 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:54,757 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:54,806 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:54,810 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:54,812 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:54,816 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:54,819 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:54,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:54,834 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-28 05:41:54,835 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:196, output treesize:32 [2019-12-28 05:41:58,598 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 109 times. [2019-12-28 05:41:58,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-12-28 05:41:58,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:41:58,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-12-28 05:41:58,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=4362, Unknown=0, NotChecked=0, Total=4556 [2019-12-28 05:41:58,600 INFO L87 Difference]: Start difference. First operand 2398 states and 6022 transitions. Second operand 68 states. [2019-12-28 05:42:01,311 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-12-28 05:42:01,617 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-12-28 05:42:02,771 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-12-28 05:42:03,150 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-12-28 05:42:03,909 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-28 05:42:05,126 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-28 05:42:05,928 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-28 05:42:06,185 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-12-28 05:42:06,657 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-28 05:42:07,035 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-12-28 05:42:07,272 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-12-28 05:42:07,656 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-28 05:42:07,987 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-12-28 05:42:08,706 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-12-28 05:42:09,754 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-12-28 05:42:10,422 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2019-12-28 05:42:11,925 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-12-28 05:42:12,316 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-12-28 05:42:12,704 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-12-28 05:42:13,261 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2019-12-28 05:42:13,531 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-12-28 05:42:13,952 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-12-28 05:42:14,372 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-12-28 05:42:15,173 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-12-28 05:42:15,782 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-28 05:42:16,100 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-28 05:42:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:42:18,148 INFO L93 Difference]: Finished difference Result 3091 states and 7547 transitions. [2019-12-28 05:42:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-28 05:42:18,149 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 109 [2019-12-28 05:42:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:42:18,152 INFO L225 Difference]: With dead ends: 3091 [2019-12-28 05:42:18,152 INFO L226 Difference]: Without dead ends: 2931 [2019-12-28 05:42:18,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 67 SyntacticMatches, 10 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1798 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=1179, Invalid=10163, Unknown=0, NotChecked=0, Total=11342 [2019-12-28 05:42:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2019-12-28 05:42:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 2511. [2019-12-28 05:42:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2511 states. [2019-12-28 05:42:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 6325 transitions. [2019-12-28 05:42:18,191 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 6325 transitions. Word has length 109 [2019-12-28 05:42:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:42:18,191 INFO L462 AbstractCegarLoop]: Abstraction has 2511 states and 6325 transitions. [2019-12-28 05:42:18,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-12-28 05:42:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 6325 transitions. [2019-12-28 05:42:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-28 05:42:18,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:42:18,197 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, 1, 1, 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 05:42:18,197 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:42:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:42:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash 33425779, now seen corresponding path program 5 times [2019-12-28 05:42:18,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:42:18,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936429452] [2019-12-28 05:42:18,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:42:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:42:19,726 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2019-12-28 05:42:20,521 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 05:42:20,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936429452] [2019-12-28 05:42:20,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:42:20,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-12-28 05:42:20,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [317379627] [2019-12-28 05:42:20,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:42:20,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:42:21,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 681 states and 1605 transitions. [2019-12-28 05:42:21,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:42:21,619 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:21,622 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:21,625 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:21,628 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:21,642 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:21,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:42:21,701 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:21,705 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:21,709 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:21,711 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:21,713 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:21,730 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:42:21,730 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-28 05:42:21,730 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:233, output treesize:28 [2019-12-28 05:42:26,220 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:26,224 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:26,227 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:26,230 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:26,239 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:26,351 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-28 05:42:26,351 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:42:26,357 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:26,363 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:26,367 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:26,371 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:26,375 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:42:26,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:42:26,469 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-28 05:42:26,469 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:320, output treesize:120 [2019-12-28 05:42:28,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 133 times. [2019-12-28 05:42:28,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-12-28 05:42:28,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:42:28,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-12-28 05:42:28,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=5476, Unknown=0, NotChecked=0, Total=5700 [2019-12-28 05:42:28,519 INFO L87 Difference]: Start difference. First operand 2511 states and 6325 transitions. Second operand 76 states. [2019-12-28 05:42:31,589 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-12-28 05:42:31,930 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-12-28 05:42:32,469 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2019-12-28 05:42:33,534 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-12-28 05:42:34,110 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-12-28 05:42:34,568 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-12-28 05:42:35,063 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-12-28 05:42:35,593 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 62 [2019-12-28 05:42:36,017 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-28 05:42:36,444 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-12-28 05:42:37,303 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 64 [2019-12-28 05:42:37,924 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-12-28 05:42:39,176 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2019-12-28 05:42:40,338 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 66 [2019-12-28 05:42:40,694 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-12-28 05:42:41,452 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-12-28 05:42:41,987 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2019-12-28 05:42:42,334 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-12-28 05:42:43,115 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-12-28 05:42:43,421 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-12-28 05:42:43,961 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 66 [2019-12-28 05:42:44,269 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-12-28 05:42:44,755 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-12-28 05:42:45,172 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-12-28 05:42:45,729 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-12-28 05:42:46,849 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-28 05:42:48,070 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 58 [2019-12-28 05:42:48,724 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2019-12-28 05:42:49,265 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 62 [2019-12-28 05:42:50,021 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2019-12-28 05:42:50,625 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-28 05:42:51,254 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 66 [2019-12-28 05:42:51,866 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 61 [2019-12-28 05:42:52,676 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-12-28 05:42:53,301 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-28 05:42:53,648 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-12-28 05:42:54,250 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-28 05:42:54,787 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 69 [2019-12-28 05:42:55,448 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-12-28 05:42:56,354 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-12-28 05:42:57,337 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-12-28 05:42:57,804 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-12-28 05:42:58,497 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 61 [2019-12-28 05:42:59,217 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-28 05:42:59,726 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-28 05:43:00,908 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-12-28 05:43:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:43:03,322 INFO L93 Difference]: Finished difference Result 3426 states and 8254 transitions. [2019-12-28 05:43:03,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-28 05:43:03,322 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 109 [2019-12-28 05:43:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:43:03,326 INFO L225 Difference]: With dead ends: 3426 [2019-12-28 05:43:03,326 INFO L226 Difference]: Without dead ends: 2596 [2019-12-28 05:43:03,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 84 SyntacticMatches, 8 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3591 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=1866, Invalid=17316, Unknown=0, NotChecked=0, Total=19182 [2019-12-28 05:43:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2019-12-28 05:43:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2072. [2019-12-28 05:43:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2019-12-28 05:43:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 5156 transitions. [2019-12-28 05:43:03,353 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 5156 transitions. Word has length 109 [2019-12-28 05:43:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:43:03,353 INFO L462 AbstractCegarLoop]: Abstraction has 2072 states and 5156 transitions. [2019-12-28 05:43:03,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-12-28 05:43:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 5156 transitions. [2019-12-28 05:43:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-28 05:43:03,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:43:03,357 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, 1, 1, 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 05:43:03,358 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:43:03,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:43:03,358 INFO L82 PathProgramCache]: Analyzing trace with hash 494334269, now seen corresponding path program 6 times [2019-12-28 05:43:03,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:43:03,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063384376] [2019-12-28 05:43:03,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:43:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:43:05,435 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 05:43:05,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063384376] [2019-12-28 05:43:05,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:43:05,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-12-28 05:43:05,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2091160134] [2019-12-28 05:43:05,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:43:05,450 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:43:06,383 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 1057 states and 2639 transitions. [2019-12-28 05:43:06,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:43:07,587 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,590 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,593 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,598 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,603 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,607 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,610 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,696 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:43:07,699 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,702 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,705 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,708 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,716 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,720 INFO L534 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,722 INFO L534 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:07,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:43:07,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2019-12-28 05:43:07,749 INFO L239 ElimStorePlain]: Needed 15 recursive calls to eliminate 2 variables, input treesize:333, output treesize:46 [2019-12-28 05:43:07,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-28 05:43:08,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:08,911 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:08,916 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:08,919 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:08,923 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:08,932 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:08,937 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:09,056 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-28 05:43:09,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:43:09,063 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:09,068 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:09,072 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:09,076 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:09,082 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:09,088 INFO L534 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:09,093 INFO L534 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-12-28 05:43:09,139 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:43:09,140 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2019-12-28 05:43:09,140 INFO L239 ElimStorePlain]: Needed 15 recursive calls to eliminate 2 variables, input treesize:349, output treesize:62 [2019-12-28 05:43:15,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 99 times. [2019-12-28 05:43:15,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-12-28 05:43:15,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:43:15,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-12-28 05:43:15,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=4242, Unknown=0, NotChecked=0, Total=4422 [2019-12-28 05:43:15,146 INFO L87 Difference]: Start difference. First operand 2072 states and 5156 transitions. Second operand 67 states. [2019-12-28 05:43:17,960 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-12-28 05:43:18,688 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-12-28 05:43:19,062 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-12-28 05:43:19,751 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-28 05:43:20,211 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-28 05:43:20,990 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 78 [2019-12-28 05:43:21,434 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-28 05:43:22,012 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-12-28 05:43:22,428 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-12-28 05:43:23,126 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 72 [2019-12-28 05:43:23,724 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 64 [2019-12-28 05:43:24,435 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 77 [2019-12-28 05:43:25,092 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 70 [2019-12-28 05:43:25,686 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 71 [2019-12-28 05:43:26,474 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 80 [2019-12-28 05:43:27,212 WARN L192 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 74 [2019-12-28 05:43:27,880 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-28 05:43:28,660 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 74 [2019-12-28 05:43:28,981 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-28 05:43:29,963 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 79 [2019-12-28 05:43:30,735 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 73 [2019-12-28 05:43:31,326 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 Received shutdown request... [2019-12-28 05:43:31,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-28 05:43:31,611 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-28 05:43:31,617 WARN L227 ceAbstractionStarter]: Timeout [2019-12-28 05:43:31,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 05:43:31 BasicIcfg [2019-12-28 05:43:31,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 05:43:31,619 INFO L168 Benchmark]: Toolchain (without parser) took 250299.52 ms. Allocated memory was 138.4 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 99.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 316.1 MB. Max. memory is 7.1 GB. [2019-12-28 05:43:31,619 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-28 05:43:31,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1519.84 ms. Allocated memory was 138.4 MB in the beginning and 236.5 MB in the end (delta: 98.0 MB). Free memory was 99.7 MB in the beginning and 167.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 80.3 MB. Max. memory is 7.1 GB. [2019-12-28 05:43:31,620 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.63 ms. Allocated memory is still 236.5 MB. Free memory was 167.9 MB in the beginning and 164.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-28 05:43:31,620 INFO L168 Benchmark]: Boogie Preprocessor took 53.41 ms. Allocated memory is still 236.5 MB. Free memory was 164.9 MB in the beginning and 162.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-28 05:43:31,621 INFO L168 Benchmark]: RCFGBuilder took 851.91 ms. Allocated memory is still 236.5 MB. Free memory was 162.0 MB in the beginning and 115.0 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-28 05:43:31,621 INFO L168 Benchmark]: TraceAbstraction took 247799.57 ms. Allocated memory was 236.5 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 113.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 231.7 MB. Max. memory is 7.1 GB. [2019-12-28 05:43:31,622 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1519.84 ms. Allocated memory was 138.4 MB in the beginning and 236.5 MB in the end (delta: 98.0 MB). Free memory was 99.7 MB in the beginning and 167.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 80.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.63 ms. Allocated memory is still 236.5 MB. Free memory was 167.9 MB in the beginning and 164.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.41 ms. Allocated memory is still 236.5 MB. Free memory was 164.9 MB in the beginning and 162.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 851.91 ms. Allocated memory is still 236.5 MB. Free memory was 162.0 MB in the beginning and 115.0 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247799.57 ms. Allocated memory was 236.5 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 113.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 231.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1682]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1682). Cancelled while BasicCegarLoop was constructing difference of abstraction (2072states) and FLOYD_HOARE automaton (currently 31 states, 67 states before enhancement),while ReachableStatesComputation was computing reachable states (393 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1682]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1682). Cancelled while BasicCegarLoop was constructing difference of abstraction (2072states) and FLOYD_HOARE automaton (currently 31 states, 67 states before enhancement),while ReachableStatesComputation was computing reachable states (393 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1682]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1682). Cancelled while BasicCegarLoop was constructing difference of abstraction (2072states) and FLOYD_HOARE automaton (currently 31 states, 67 states before enhancement),while ReachableStatesComputation was computing reachable states (393 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1682]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1682). Cancelled while BasicCegarLoop was constructing difference of abstraction (2072states) and FLOYD_HOARE automaton (currently 31 states, 67 states before enhancement),while ReachableStatesComputation was computing reachable states (393 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1682]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1682). Cancelled while BasicCegarLoop was constructing difference of abstraction (2072states) and FLOYD_HOARE automaton (currently 31 states, 67 states before enhancement),while ReachableStatesComputation was computing reachable states (393 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1682]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1682). Cancelled while BasicCegarLoop was constructing difference of abstraction (2072states) and FLOYD_HOARE automaton (currently 31 states, 67 states before enhancement),while ReachableStatesComputation was computing reachable states (393 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Result: TIMEOUT, OverallTime: 247.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 169.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3822 SDtfs, 15588 SDslu, 62717 SDs, 0 SdLazy, 38928 SolverSat, 1774 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1704 GetRequests, 606 SyntacticMatches, 102 SemanticMatches, 996 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15452 ImplicationChecksByTransitivity, 146.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8009occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 12388 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 1633 NumberOfCodeBlocks, 1633 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1615 ConstructedInterpolants, 0 QuantifiedInterpolants, 2288457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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