/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 03:04:21,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 03:04:21,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 03:04:21,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 03:04:21,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 03:04:21,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 03:04:21,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 03:04:21,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 03:04:21,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 03:04:21,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 03:04:21,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 03:04:21,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 03:04:21,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 03:04:21,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 03:04:21,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 03:04:21,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 03:04:21,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 03:04:21,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 03:04:21,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 03:04:21,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 03:04:21,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 03:04:21,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 03:04:21,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 03:04:21,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 03:04:21,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 03:04:21,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 03:04:21,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 03:04:21,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 03:04:21,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 03:04:21,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 03:04:21,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 03:04:21,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 03:04:21,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 03:04:21,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 03:04:21,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 03:04:21,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 03:04:21,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 03:04:21,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 03:04:21,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 03:04:21,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 03:04:21,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 03:04:21,819 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-VariableLbe.epf [2020-04-18 03:04:21,840 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 03:04:21,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 03:04:21,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 03:04:21,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 03:04:21,842 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 03:04:21,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 03:04:21,843 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 03:04:21,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 03:04:21,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 03:04:21,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 03:04:21,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 03:04:21,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 03:04:21,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 03:04:21,845 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 03:04:21,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 03:04:21,845 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 03:04:21,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 03:04:21,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 03:04:21,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 03:04:21,846 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 03:04:21,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 03:04:21,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 03:04:21,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 03:04:21,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 03:04:21,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 03:04:21,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-04-18 03:04:21,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 03:04:21,847 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-04-18 03:04:21,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 03:04:21,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 03:04:22,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 03:04:22,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 03:04:22,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 03:04:22,190 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 03:04:22,190 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 03:04:22,191 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i [2020-04-18 03:04:22,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea52d34c4/294c8f95fef844a7b76860f50c684ae4/FLAGfa456bda6 [2020-04-18 03:04:22,831 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 03:04:22,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i [2020-04-18 03:04:22,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea52d34c4/294c8f95fef844a7b76860f50c684ae4/FLAGfa456bda6 [2020-04-18 03:04:23,115 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea52d34c4/294c8f95fef844a7b76860f50c684ae4 [2020-04-18 03:04:23,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 03:04:23,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 03:04:23,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 03:04:23,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 03:04:23,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 03:04:23,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:04:23" (1/1) ... [2020-04-18 03:04:23,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26744db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:23, skipping insertion in model container [2020-04-18 03:04:23,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:04:23" (1/1) ... [2020-04-18 03:04:23,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 03:04:23,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 03:04:23,485 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-18 03:04:23,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 03:04:23,891 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 03:04:23,905 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-18 03:04:23,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 03:04:24,142 INFO L208 MainTranslator]: Completed translation [2020-04-18 03:04:24,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:24 WrapperNode [2020-04-18 03:04:24,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 03:04:24,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 03:04:24,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 03:04:24,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 03:04:24,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:24" (1/1) ... [2020-04-18 03:04:24,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:24" (1/1) ... [2020-04-18 03:04:24,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 03:04:24,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 03:04:24,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 03:04:24,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 03:04:24,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:24" (1/1) ... [2020-04-18 03:04:24,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:24" (1/1) ... [2020-04-18 03:04:24,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:24" (1/1) ... [2020-04-18 03:04:24,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:24" (1/1) ... [2020-04-18 03:04:24,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:24" (1/1) ... [2020-04-18 03:04:24,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:24" (1/1) ... [2020-04-18 03:04:24,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:24" (1/1) ... [2020-04-18 03:04:24,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 03:04:24,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 03:04:24,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 03:04:24,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 03:04:24,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 03:04:24,430 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2020-04-18 03:04:24,430 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2020-04-18 03:04:24,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 03:04:24,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-04-18 03:04:24,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 03:04:24,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-18 03:04:24,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 03:04:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-04-18 03:04:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-04-18 03:04:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 03:04:24,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 03:04:24,436 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 03:04:25,536 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 03:04:25,538 INFO L295 CfgBuilder]: Removed 40 assume(true) statements. [2020-04-18 03:04:25,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:04:25 BoogieIcfgContainer [2020-04-18 03:04:25,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 03:04:25,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 03:04:25,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 03:04:25,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 03:04:25,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 03:04:23" (1/3) ... [2020-04-18 03:04:25,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b744f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:04:25, skipping insertion in model container [2020-04-18 03:04:25,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:04:24" (2/3) ... [2020-04-18 03:04:25,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b744f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:04:25, skipping insertion in model container [2020-04-18 03:04:25,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:04:25" (3/3) ... [2020-04-18 03:04:25,563 INFO L109 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.i [2020-04-18 03:04:25,573 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 03:04:25,574 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 03:04:25,583 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-04-18 03:04:25,585 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 03:04:25,649 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,649 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,650 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,650 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,650 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,650 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,651 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,651 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,651 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,651 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,651 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,652 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,652 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,652 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,652 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,652 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,652 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,653 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,653 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,653 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,654 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,654 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,654 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,654 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,654 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,654 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,655 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,655 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,655 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,656 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,656 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,656 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,656 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,657 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,657 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,657 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,658 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,658 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,658 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,658 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,658 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,659 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,659 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,659 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,659 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,660 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,660 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,660 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,660 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,660 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,661 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,661 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,661 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,661 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,661 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,661 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,662 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,662 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,662 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,662 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,662 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,663 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,663 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,663 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,663 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,664 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,664 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,664 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,664 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,664 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,665 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,665 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,665 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,665 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,665 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,665 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,666 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,666 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,666 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,666 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,667 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,667 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,667 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,667 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,668 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,668 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,669 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,669 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,669 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,669 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,669 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,670 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,670 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,670 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,670 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,670 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,671 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,671 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,671 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,671 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,671 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,672 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,675 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,676 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,676 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,676 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,683 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,683 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,684 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,684 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,684 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,684 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,684 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,684 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,685 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,685 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,685 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,685 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,685 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,686 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,686 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,686 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,686 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,686 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,687 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,687 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,687 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,687 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,687 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,688 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,688 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,688 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,688 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,688 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,689 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,689 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,689 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,689 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,689 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,689 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,690 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,690 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,690 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,690 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,690 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,690 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,691 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,691 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,691 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,691 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,691 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,691 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,692 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,692 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,692 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,692 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,692 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,692 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,692 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,693 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,693 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,693 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,693 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,693 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,693 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,694 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,694 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,694 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,694 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,694 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,694 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,695 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,695 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,695 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,695 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,695 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,695 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,696 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,696 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,696 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,696 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,696 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,696 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,697 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,697 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,697 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,697 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,697 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,697 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,698 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,701 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,701 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,702 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,702 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,702 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,702 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,702 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,702 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,703 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,703 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,703 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,703 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,703 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,703 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,704 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,704 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,704 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,704 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,704 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,705 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,705 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,705 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,705 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,705 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,705 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,706 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,706 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,706 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,706 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,706 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,706 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,707 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,707 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,707 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,707 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,707 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,708 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,708 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,708 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,708 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,708 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,709 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,709 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,709 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:04:25,730 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-04-18 03:04:25,751 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 03:04:25,751 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 03:04:25,751 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 03:04:25,751 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 03:04:25,751 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 03:04:25,751 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 03:04:25,752 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 03:04:25,752 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 03:04:25,778 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 426 places, 455 transitions, 918 flow [2020-04-18 03:04:25,780 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 426 places, 455 transitions, 918 flow [2020-04-18 03:04:25,953 INFO L129 PetriNetUnfolder]: 33/454 cut-off events. [2020-04-18 03:04:25,953 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-04-18 03:04:25,966 INFO L80 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 454 events. 33/454 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1111 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 328. Up to 3 conditions per place. [2020-04-18 03:04:25,998 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 426 places, 455 transitions, 918 flow [2020-04-18 03:04:26,145 INFO L129 PetriNetUnfolder]: 33/454 cut-off events. [2020-04-18 03:04:26,145 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-04-18 03:04:26,152 INFO L80 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 454 events. 33/454 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1111 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 328. Up to 3 conditions per place. [2020-04-18 03:04:26,178 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 31742 [2020-04-18 03:04:26,179 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 03:04:27,741 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 03:04:27,760 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 03:04:27,761 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 03:04:27,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2020-04-18 03:04:28,061 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 03:04:28,072 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 03:04:28,073 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 03:04:28,074 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2020-04-18 03:04:30,269 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 03:04:30,285 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 03:04:30,286 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 03:04:30,287 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:74 [2020-04-18 03:04:30,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 03:04:30,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 03:04:30,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 03:04:31,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 03:04:32,006 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-04-18 03:04:32,019 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 03:04:32,081 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 03:04:32,083 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-04-18 03:04:32,083 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:172, output treesize:181 [2020-04-18 03:04:33,736 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-04-18 03:04:33,843 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-04-18 03:04:34,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 03:04:34,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 03:04:35,214 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2020-04-18 03:04:35,409 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2020-04-18 03:04:35,934 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-04-18 03:04:36,293 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-04-18 03:04:36,680 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-04-18 03:04:36,886 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2020-04-18 03:04:37,339 WARN L192 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-04-18 03:04:37,725 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-04-18 03:04:39,427 WARN L192 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 178 DAG size of output: 164 [2020-04-18 03:04:39,452 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 03:04:40,288 WARN L192 SmtUtils]: Spent 836.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-04-18 03:04:40,289 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 03:04:40,290 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-04-18 03:04:40,290 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:452, output treesize:494 [2020-04-18 03:04:41,093 WARN L192 SmtUtils]: Spent 801.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-04-18 03:04:41,136 INFO L206 etLargeBlockEncoding]: Checked pairs total: 73353 [2020-04-18 03:04:41,137 INFO L214 etLargeBlockEncoding]: Total number of compositions: 424 [2020-04-18 03:04:41,140 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 122 transitions, 252 flow [2020-04-18 03:04:41,207 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1490 states. [2020-04-18 03:04:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states. [2020-04-18 03:04:41,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-18 03:04:41,215 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:04:41,215 INFO L425 BasicCegarLoop]: trace histogram [1] [2020-04-18 03:04:41,216 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:04:41,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:04:41,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1591, now seen corresponding path program 1 times [2020-04-18 03:04:41,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:04:41,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526506471] [2020-04-18 03:04:41,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:04:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:04:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:04:41,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526506471] [2020-04-18 03:04:41,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:04:41,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-04-18 03:04:41,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426304313] [2020-04-18 03:04:41,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-04-18 03:04:41,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:04:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 03:04:41,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 03:04:41,370 INFO L87 Difference]: Start difference. First operand 1490 states. Second operand 2 states. [2020-04-18 03:04:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:04:41,437 INFO L93 Difference]: Finished difference Result 1489 states and 3337 transitions. [2020-04-18 03:04:41,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-04-18 03:04:41,438 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-04-18 03:04:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:04:41,493 INFO L225 Difference]: With dead ends: 1489 [2020-04-18 03:04:41,493 INFO L226 Difference]: Without dead ends: 1469 [2020-04-18 03:04:41,498 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 03:04:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-04-18 03:04:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2020-04-18 03:04:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2020-04-18 03:04:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3296 transitions. [2020-04-18 03:04:41,649 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3296 transitions. Word has length 1 [2020-04-18 03:04:41,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:04:41,649 INFO L479 AbstractCegarLoop]: Abstraction has 1469 states and 3296 transitions. [2020-04-18 03:04:41,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-04-18 03:04:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3296 transitions. [2020-04-18 03:04:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-04-18 03:04:41,650 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:04:41,651 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-04-18 03:04:41,651 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:04:41,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:04:41,651 INFO L82 PathProgramCache]: Analyzing trace with hash -651818284, now seen corresponding path program 1 times [2020-04-18 03:04:41,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:04:41,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328420149] [2020-04-18 03:04:41,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:04:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:04:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:04:41,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328420149] [2020-04-18 03:04:41,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:04:41,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 03:04:41,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579981138] [2020-04-18 03:04:41,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 03:04:41,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:04:41,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 03:04:41,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 03:04:41,797 INFO L87 Difference]: Start difference. First operand 1469 states and 3296 transitions. Second operand 3 states. [2020-04-18 03:04:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:04:41,858 INFO L93 Difference]: Finished difference Result 2761 states and 6206 transitions. [2020-04-18 03:04:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 03:04:41,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-04-18 03:04:41,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:04:41,877 INFO L225 Difference]: With dead ends: 2761 [2020-04-18 03:04:41,878 INFO L226 Difference]: Without dead ends: 2761 [2020-04-18 03:04:41,879 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 03:04:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2020-04-18 03:04:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 1488. [2020-04-18 03:04:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2020-04-18 03:04:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3336 transitions. [2020-04-18 03:04:41,936 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3336 transitions. Word has length 6 [2020-04-18 03:04:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:04:41,936 INFO L479 AbstractCegarLoop]: Abstraction has 1488 states and 3336 transitions. [2020-04-18 03:04:41,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 03:04:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3336 transitions. [2020-04-18 03:04:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 03:04:41,937 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:04:41,937 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:04:41,937 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:04:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:04:41,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1267854911, now seen corresponding path program 1 times [2020-04-18 03:04:41,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:04:41,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873261843] [2020-04-18 03:04:41,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:04:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:04:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:04:42,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873261843] [2020-04-18 03:04:42,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:04:42,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 03:04:42,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655432193] [2020-04-18 03:04:42,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 03:04:42,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:04:42,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 03:04:42,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 03:04:42,014 INFO L87 Difference]: Start difference. First operand 1488 states and 3336 transitions. Second operand 3 states. [2020-04-18 03:04:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:04:42,041 INFO L93 Difference]: Finished difference Result 1488 states and 3317 transitions. [2020-04-18 03:04:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 03:04:42,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-04-18 03:04:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:04:42,051 INFO L225 Difference]: With dead ends: 1488 [2020-04-18 03:04:42,052 INFO L226 Difference]: Without dead ends: 1488 [2020-04-18 03:04:42,052 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 03:04:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2020-04-18 03:04:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2020-04-18 03:04:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2020-04-18 03:04:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3317 transitions. [2020-04-18 03:04:42,093 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3317 transitions. Word has length 7 [2020-04-18 03:04:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:04:42,093 INFO L479 AbstractCegarLoop]: Abstraction has 1488 states and 3317 transitions. [2020-04-18 03:04:42,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 03:04:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3317 transitions. [2020-04-18 03:04:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 03:04:42,095 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:04:42,095 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:04:42,095 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:04:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:04:42,095 INFO L82 PathProgramCache]: Analyzing trace with hash 660801943, now seen corresponding path program 1 times [2020-04-18 03:04:42,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:04:42,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276118377] [2020-04-18 03:04:42,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:04:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:04:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:04:42,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276118377] [2020-04-18 03:04:42,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:04:42,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 03:04:42,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854232669] [2020-04-18 03:04:42,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 03:04:42,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:04:42,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 03:04:42,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 03:04:42,229 INFO L87 Difference]: Start difference. First operand 1488 states and 3317 transitions. Second operand 6 states. [2020-04-18 03:04:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:04:42,911 INFO L93 Difference]: Finished difference Result 1874 states and 4178 transitions. [2020-04-18 03:04:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-18 03:04:42,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-04-18 03:04:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:04:42,923 INFO L225 Difference]: With dead ends: 1874 [2020-04-18 03:04:42,923 INFO L226 Difference]: Without dead ends: 1874 [2020-04-18 03:04:42,923 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-04-18 03:04:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2020-04-18 03:04:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1595. [2020-04-18 03:04:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2020-04-18 03:04:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3562 transitions. [2020-04-18 03:04:42,976 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3562 transitions. Word has length 8 [2020-04-18 03:04:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:04:42,977 INFO L479 AbstractCegarLoop]: Abstraction has 1595 states and 3562 transitions. [2020-04-18 03:04:42,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 03:04:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3562 transitions. [2020-04-18 03:04:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 03:04:42,981 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:04:42,981 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:04:42,982 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:04:42,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:04:42,982 INFO L82 PathProgramCache]: Analyzing trace with hash -624152238, now seen corresponding path program 1 times [2020-04-18 03:04:42,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:04:42,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612950109] [2020-04-18 03:04:42,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:04:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:04:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:04:43,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612950109] [2020-04-18 03:04:43,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:04:43,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 03:04:43,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848969855] [2020-04-18 03:04:43,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 03:04:43,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:04:43,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 03:04:43,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 03:04:43,065 INFO L87 Difference]: Start difference. First operand 1595 states and 3562 transitions. Second operand 3 states. [2020-04-18 03:04:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:04:43,146 INFO L93 Difference]: Finished difference Result 2622 states and 5848 transitions. [2020-04-18 03:04:43,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 03:04:43,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-04-18 03:04:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:04:43,161 INFO L225 Difference]: With dead ends: 2622 [2020-04-18 03:04:43,162 INFO L226 Difference]: Without dead ends: 2622 [2020-04-18 03:04:43,162 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 03:04:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2020-04-18 03:04:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 1652. [2020-04-18 03:04:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2020-04-18 03:04:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 3682 transitions. [2020-04-18 03:04:43,287 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 3682 transitions. Word has length 10 [2020-04-18 03:04:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:04:43,288 INFO L479 AbstractCegarLoop]: Abstraction has 1652 states and 3682 transitions. [2020-04-18 03:04:43,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 03:04:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 3682 transitions. [2020-04-18 03:04:43,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 03:04:43,300 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:04:43,300 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:04:43,300 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:04:43,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:04:43,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1495626362, now seen corresponding path program 1 times [2020-04-18 03:04:43,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:04:43,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37822000] [2020-04-18 03:04:43,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:04:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:04:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:04:43,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37822000] [2020-04-18 03:04:43,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:04:43,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 03:04:43,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138968219] [2020-04-18 03:04:43,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 03:04:43,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:04:43,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 03:04:43,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-04-18 03:04:43,535 INFO L87 Difference]: Start difference. First operand 1652 states and 3682 transitions. Second operand 11 states. [2020-04-18 03:04:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:04:45,591 INFO L93 Difference]: Finished difference Result 2046 states and 4542 transitions. [2020-04-18 03:04:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-18 03:04:45,591 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-04-18 03:04:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:04:45,604 INFO L225 Difference]: With dead ends: 2046 [2020-04-18 03:04:45,604 INFO L226 Difference]: Without dead ends: 2046 [2020-04-18 03:04:45,605 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2020-04-18 03:04:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2020-04-18 03:04:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1661. [2020-04-18 03:04:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1661 states. [2020-04-18 03:04:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 3702 transitions. [2020-04-18 03:04:45,650 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 3702 transitions. Word has length 14 [2020-04-18 03:04:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:04:45,651 INFO L479 AbstractCegarLoop]: Abstraction has 1661 states and 3702 transitions. [2020-04-18 03:04:45,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 03:04:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 3702 transitions. [2020-04-18 03:04:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 03:04:45,652 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:04:45,652 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:04:45,653 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:04:45,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:04:45,698 INFO L82 PathProgramCache]: Analyzing trace with hash 341856152, now seen corresponding path program 2 times [2020-04-18 03:04:45,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:04:45,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715884319] [2020-04-18 03:04:45,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:04:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:04:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:04:45,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715884319] [2020-04-18 03:04:45,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:04:45,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 03:04:45,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020584447] [2020-04-18 03:04:45,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 03:04:45,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:04:45,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 03:04:45,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-04-18 03:04:45,877 INFO L87 Difference]: Start difference. First operand 1661 states and 3702 transitions. Second operand 11 states. [2020-04-18 03:04:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:04:48,079 INFO L93 Difference]: Finished difference Result 2017 states and 4481 transitions. [2020-04-18 03:04:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-04-18 03:04:48,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-04-18 03:04:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:04:48,091 INFO L225 Difference]: With dead ends: 2017 [2020-04-18 03:04:48,091 INFO L226 Difference]: Without dead ends: 2017 [2020-04-18 03:04:48,092 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=491, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:04:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2020-04-18 03:04:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1661. [2020-04-18 03:04:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1661 states. [2020-04-18 03:04:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 3702 transitions. [2020-04-18 03:04:48,138 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 3702 transitions. Word has length 14 [2020-04-18 03:04:48,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:04:48,138 INFO L479 AbstractCegarLoop]: Abstraction has 1661 states and 3702 transitions. [2020-04-18 03:04:48,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 03:04:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 3702 transitions. [2020-04-18 03:04:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 03:04:48,140 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:04:48,140 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:04:48,140 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:04:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:04:48,141 INFO L82 PathProgramCache]: Analyzing trace with hash -70509489, now seen corresponding path program 1 times [2020-04-18 03:04:48,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:04:48,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80563510] [2020-04-18 03:04:48,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:04:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:04:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:04:48,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80563510] [2020-04-18 03:04:48,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:04:48,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 03:04:48,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080984647] [2020-04-18 03:04:48,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-18 03:04:48,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:04:48,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 03:04:48,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-04-18 03:04:48,393 INFO L87 Difference]: Start difference. First operand 1661 states and 3702 transitions. Second operand 8 states. [2020-04-18 03:04:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:04:49,643 INFO L93 Difference]: Finished difference Result 2257 states and 4977 transitions. [2020-04-18 03:04:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-04-18 03:04:49,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-04-18 03:04:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:04:49,655 INFO L225 Difference]: With dead ends: 2257 [2020-04-18 03:04:49,655 INFO L226 Difference]: Without dead ends: 2200 [2020-04-18 03:04:49,656 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:04:49,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2020-04-18 03:04:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 1711. [2020-04-18 03:04:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2020-04-18 03:04:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 3817 transitions. [2020-04-18 03:04:49,698 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 3817 transitions. Word has length 14 [2020-04-18 03:04:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:04:49,698 INFO L479 AbstractCegarLoop]: Abstraction has 1711 states and 3817 transitions. [2020-04-18 03:04:49,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-18 03:04:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 3817 transitions. [2020-04-18 03:04:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:04:49,700 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:04:49,700 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:04:49,700 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:04:49,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:04:49,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1644221894, now seen corresponding path program 1 times [2020-04-18 03:04:49,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:04:49,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623969593] [2020-04-18 03:04:49,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:04:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:04:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:04:49,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623969593] [2020-04-18 03:04:49,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:04:49,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 03:04:49,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558563780] [2020-04-18 03:04:49,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-18 03:04:49,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:04:49,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 03:04:49,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-04-18 03:04:49,908 INFO L87 Difference]: Start difference. First operand 1711 states and 3817 transitions. Second operand 8 states. [2020-04-18 03:04:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:04:51,170 INFO L93 Difference]: Finished difference Result 2245 states and 5000 transitions. [2020-04-18 03:04:51,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-04-18 03:04:51,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-04-18 03:04:51,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:04:51,182 INFO L225 Difference]: With dead ends: 2245 [2020-04-18 03:04:51,183 INFO L226 Difference]: Without dead ends: 2245 [2020-04-18 03:04:51,183 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-04-18 03:04:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2020-04-18 03:04:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1774. [2020-04-18 03:04:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1774 states. [2020-04-18 03:04:51,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 3959 transitions. [2020-04-18 03:04:51,237 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 3959 transitions. Word has length 15 [2020-04-18 03:04:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:04:51,237 INFO L479 AbstractCegarLoop]: Abstraction has 1774 states and 3959 transitions. [2020-04-18 03:04:51,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-18 03:04:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 3959 transitions. [2020-04-18 03:04:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:04:51,239 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:04:51,239 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:04:51,239 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:04:51,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:04:51,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1537021170, now seen corresponding path program 2 times [2020-04-18 03:04:51,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:04:51,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600214462] [2020-04-18 03:04:51,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:04:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:04:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:04:51,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600214462] [2020-04-18 03:04:51,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:04:51,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 03:04:51,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200194656] [2020-04-18 03:04:51,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:04:51,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:04:51,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:04:51,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:04:51,820 INFO L87 Difference]: Start difference. First operand 1774 states and 3959 transitions. Second operand 13 states. [2020-04-18 03:04:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:04:54,661 INFO L93 Difference]: Finished difference Result 2468 states and 5478 transitions. [2020-04-18 03:04:54,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-04-18 03:04:54,661 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-18 03:04:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:04:54,669 INFO L225 Difference]: With dead ends: 2468 [2020-04-18 03:04:54,669 INFO L226 Difference]: Without dead ends: 2468 [2020-04-18 03:04:54,670 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2020-04-18 03:04:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2020-04-18 03:04:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 1790. [2020-04-18 03:04:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1790 states. [2020-04-18 03:04:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 3997 transitions. [2020-04-18 03:04:54,716 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 3997 transitions. Word has length 15 [2020-04-18 03:04:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:04:54,716 INFO L479 AbstractCegarLoop]: Abstraction has 1790 states and 3997 transitions. [2020-04-18 03:04:54,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:04:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 3997 transitions. [2020-04-18 03:04:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:04:54,717 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:04:54,717 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:04:54,718 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:04:54,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:04:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2048498594, now seen corresponding path program 3 times [2020-04-18 03:04:54,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:04:54,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618283730] [2020-04-18 03:04:54,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:04:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:04:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:04:55,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618283730] [2020-04-18 03:04:55,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:04:55,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 03:04:55,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510195445] [2020-04-18 03:04:55,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:04:55,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:04:55,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:04:55,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:04:55,058 INFO L87 Difference]: Start difference. First operand 1790 states and 3997 transitions. Second operand 13 states. [2020-04-18 03:04:58,741 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 46 [2020-04-18 03:05:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:00,844 INFO L93 Difference]: Finished difference Result 2478 states and 5500 transitions. [2020-04-18 03:05:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-04-18 03:05:00,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-18 03:05:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:00,851 INFO L225 Difference]: With dead ends: 2478 [2020-04-18 03:05:00,852 INFO L226 Difference]: Without dead ends: 2478 [2020-04-18 03:05:00,852 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=501, Invalid=1221, Unknown=0, NotChecked=0, Total=1722 [2020-04-18 03:05:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2020-04-18 03:05:00,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 1804. [2020-04-18 03:05:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2020-04-18 03:05:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 4027 transitions. [2020-04-18 03:05:00,900 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 4027 transitions. Word has length 15 [2020-04-18 03:05:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:00,901 INFO L479 AbstractCegarLoop]: Abstraction has 1804 states and 4027 transitions. [2020-04-18 03:05:00,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:05:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 4027 transitions. [2020-04-18 03:05:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:00,902 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:00,902 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:00,903 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:00,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1799924856, now seen corresponding path program 4 times [2020-04-18 03:05:00,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:00,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557982124] [2020-04-18 03:05:00,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:01,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557982124] [2020-04-18 03:05:01,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:01,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 03:05:01,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036658124] [2020-04-18 03:05:01,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:05:01,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:05:01,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:05:01,175 INFO L87 Difference]: Start difference. First operand 1804 states and 4027 transitions. Second operand 13 states. [2020-04-18 03:05:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:05,991 INFO L93 Difference]: Finished difference Result 2304 states and 5112 transitions. [2020-04-18 03:05:05,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-04-18 03:05:05,992 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-18 03:05:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:05,998 INFO L225 Difference]: With dead ends: 2304 [2020-04-18 03:05:05,999 INFO L226 Difference]: Without dead ends: 2304 [2020-04-18 03:05:06,000 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=457, Invalid=1183, Unknown=0, NotChecked=0, Total=1640 [2020-04-18 03:05:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2020-04-18 03:05:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 1808. [2020-04-18 03:05:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2020-04-18 03:05:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 4035 transitions. [2020-04-18 03:05:06,043 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 4035 transitions. Word has length 15 [2020-04-18 03:05:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:06,043 INFO L479 AbstractCegarLoop]: Abstraction has 1808 states and 4035 transitions. [2020-04-18 03:05:06,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:05:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 4035 transitions. [2020-04-18 03:05:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:06,044 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:06,044 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:06,045 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:06,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:06,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1549384894, now seen corresponding path program 5 times [2020-04-18 03:05:06,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:06,046 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902799363] [2020-04-18 03:05:06,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:06,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902799363] [2020-04-18 03:05:06,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:06,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 03:05:06,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541323154] [2020-04-18 03:05:06,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:05:06,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:06,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:05:06,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:05:06,353 INFO L87 Difference]: Start difference. First operand 1808 states and 4035 transitions. Second operand 13 states. [2020-04-18 03:05:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:11,805 INFO L93 Difference]: Finished difference Result 2280 states and 5063 transitions. [2020-04-18 03:05:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-04-18 03:05:11,806 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-18 03:05:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:11,812 INFO L225 Difference]: With dead ends: 2280 [2020-04-18 03:05:11,812 INFO L226 Difference]: Without dead ends: 2280 [2020-04-18 03:05:11,813 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=443, Invalid=1197, Unknown=0, NotChecked=0, Total=1640 [2020-04-18 03:05:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2020-04-18 03:05:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1808. [2020-04-18 03:05:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2020-04-18 03:05:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 4035 transitions. [2020-04-18 03:05:11,853 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 4035 transitions. Word has length 15 [2020-04-18 03:05:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:11,854 INFO L479 AbstractCegarLoop]: Abstraction has 1808 states and 4035 transitions. [2020-04-18 03:05:11,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:05:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 4035 transitions. [2020-04-18 03:05:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:11,855 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:11,855 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:11,856 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:11,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1543438434, now seen corresponding path program 6 times [2020-04-18 03:05:11,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:11,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610145534] [2020-04-18 03:05:11,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:12,108 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610145534] [2020-04-18 03:05:12,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:12,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 03:05:12,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067418551] [2020-04-18 03:05:12,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:05:12,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:12,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:05:12,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:05:12,110 INFO L87 Difference]: Start difference. First operand 1808 states and 4035 transitions. Second operand 13 states. [2020-04-18 03:05:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:17,177 INFO L93 Difference]: Finished difference Result 2298 states and 5098 transitions. [2020-04-18 03:05:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-04-18 03:05:17,177 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-18 03:05:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:17,183 INFO L225 Difference]: With dead ends: 2298 [2020-04-18 03:05:17,183 INFO L226 Difference]: Without dead ends: 2298 [2020-04-18 03:05:17,184 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=431, Invalid=1129, Unknown=0, NotChecked=0, Total=1560 [2020-04-18 03:05:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2020-04-18 03:05:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1792. [2020-04-18 03:05:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2020-04-18 03:05:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 3999 transitions. [2020-04-18 03:05:17,221 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 3999 transitions. Word has length 15 [2020-04-18 03:05:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:17,222 INFO L479 AbstractCegarLoop]: Abstraction has 1792 states and 3999 transitions. [2020-04-18 03:05:17,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:05:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 3999 transitions. [2020-04-18 03:05:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:17,223 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:17,223 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:17,224 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:17,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1643724232, now seen corresponding path program 1 times [2020-04-18 03:05:17,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:17,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915341432] [2020-04-18 03:05:17,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:17,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915341432] [2020-04-18 03:05:17,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:17,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 03:05:17,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702938414] [2020-04-18 03:05:17,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-18 03:05:17,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:17,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 03:05:17,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-04-18 03:05:17,364 INFO L87 Difference]: Start difference. First operand 1792 states and 3999 transitions. Second operand 12 states. [2020-04-18 03:05:19,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:19,543 INFO L93 Difference]: Finished difference Result 2437 states and 5392 transitions. [2020-04-18 03:05:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-18 03:05:19,543 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-04-18 03:05:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:19,549 INFO L225 Difference]: With dead ends: 2437 [2020-04-18 03:05:19,549 INFO L226 Difference]: Without dead ends: 2437 [2020-04-18 03:05:19,550 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:05:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2020-04-18 03:05:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1819. [2020-04-18 03:05:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2020-04-18 03:05:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 4059 transitions. [2020-04-18 03:05:19,589 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 4059 transitions. Word has length 15 [2020-04-18 03:05:19,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:19,589 INFO L479 AbstractCegarLoop]: Abstraction has 1819 states and 4059 transitions. [2020-04-18 03:05:19,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-18 03:05:19,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 4059 transitions. [2020-04-18 03:05:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:19,591 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:19,591 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:19,591 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:19,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:19,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1283206298, now seen corresponding path program 2 times [2020-04-18 03:05:19,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:19,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060564817] [2020-04-18 03:05:19,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:19,732 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060564817] [2020-04-18 03:05:19,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:19,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 03:05:19,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774158058] [2020-04-18 03:05:19,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-18 03:05:19,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:19,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 03:05:19,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-04-18 03:05:19,734 INFO L87 Difference]: Start difference. First operand 1819 states and 4059 transitions. Second operand 12 states. [2020-04-18 03:05:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:22,351 INFO L93 Difference]: Finished difference Result 2446 states and 5412 transitions. [2020-04-18 03:05:22,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-18 03:05:22,351 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-04-18 03:05:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:22,357 INFO L225 Difference]: With dead ends: 2446 [2020-04-18 03:05:22,357 INFO L226 Difference]: Without dead ends: 2446 [2020-04-18 03:05:22,358 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:05:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2020-04-18 03:05:22,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 1826. [2020-04-18 03:05:22,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2020-04-18 03:05:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 4075 transitions. [2020-04-18 03:05:22,396 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 4075 transitions. Word has length 15 [2020-04-18 03:05:22,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:22,397 INFO L479 AbstractCegarLoop]: Abstraction has 1826 states and 4075 transitions. [2020-04-18 03:05:22,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-18 03:05:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 4075 transitions. [2020-04-18 03:05:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:22,398 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:22,398 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:22,398 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:22,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:22,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1604622856, now seen corresponding path program 3 times [2020-04-18 03:05:22,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:22,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101548093] [2020-04-18 03:05:22,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:22,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101548093] [2020-04-18 03:05:22,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:22,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 03:05:22,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351063863] [2020-04-18 03:05:22,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-18 03:05:22,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:22,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 03:05:22,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-04-18 03:05:22,551 INFO L87 Difference]: Start difference. First operand 1826 states and 4075 transitions. Second operand 12 states. [2020-04-18 03:05:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:25,304 INFO L93 Difference]: Finished difference Result 2506 states and 5541 transitions. [2020-04-18 03:05:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-04-18 03:05:25,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-04-18 03:05:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:25,309 INFO L225 Difference]: With dead ends: 2506 [2020-04-18 03:05:25,309 INFO L226 Difference]: Without dead ends: 2506 [2020-04-18 03:05:25,310 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=289, Invalid=641, Unknown=0, NotChecked=0, Total=930 [2020-04-18 03:05:25,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-04-18 03:05:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1833. [2020-04-18 03:05:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2020-04-18 03:05:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 4090 transitions. [2020-04-18 03:05:25,343 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 4090 transitions. Word has length 15 [2020-04-18 03:05:25,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:25,343 INFO L479 AbstractCegarLoop]: Abstraction has 1833 states and 4090 transitions. [2020-04-18 03:05:25,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-18 03:05:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 4090 transitions. [2020-04-18 03:05:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:25,344 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:25,345 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:25,345 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:25,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:25,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1465456678, now seen corresponding path program 4 times [2020-04-18 03:05:25,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:25,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118393256] [2020-04-18 03:05:25,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:25,496 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118393256] [2020-04-18 03:05:25,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:25,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 03:05:25,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053055599] [2020-04-18 03:05:25,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-18 03:05:25,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:25,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 03:05:25,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-04-18 03:05:25,498 INFO L87 Difference]: Start difference. First operand 1833 states and 4090 transitions. Second operand 12 states. [2020-04-18 03:05:27,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:27,824 INFO L93 Difference]: Finished difference Result 2348 states and 5205 transitions. [2020-04-18 03:05:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-04-18 03:05:27,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-04-18 03:05:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:27,828 INFO L225 Difference]: With dead ends: 2348 [2020-04-18 03:05:27,828 INFO L226 Difference]: Without dead ends: 2348 [2020-04-18 03:05:27,829 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:05:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2020-04-18 03:05:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1819. [2020-04-18 03:05:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2020-04-18 03:05:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 4059 transitions. [2020-04-18 03:05:27,857 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 4059 transitions. Word has length 15 [2020-04-18 03:05:27,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:27,857 INFO L479 AbstractCegarLoop]: Abstraction has 1819 states and 4059 transitions. [2020-04-18 03:05:27,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-18 03:05:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 4059 transitions. [2020-04-18 03:05:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:27,859 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:27,859 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:27,859 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1729335576, now seen corresponding path program 7 times [2020-04-18 03:05:27,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:27,860 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113547372] [2020-04-18 03:05:27,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:28,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113547372] [2020-04-18 03:05:28,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:28,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 03:05:28,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136321083] [2020-04-18 03:05:28,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-18 03:05:28,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:28,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 03:05:28,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 03:05:28,023 INFO L87 Difference]: Start difference. First operand 1819 states and 4059 transitions. Second operand 8 states. [2020-04-18 03:05:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:29,234 INFO L93 Difference]: Finished difference Result 2743 states and 6099 transitions. [2020-04-18 03:05:29,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-04-18 03:05:29,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-04-18 03:05:29,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:29,241 INFO L225 Difference]: With dead ends: 2743 [2020-04-18 03:05:29,241 INFO L226 Difference]: Without dead ends: 2743 [2020-04-18 03:05:29,242 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-04-18 03:05:29,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2020-04-18 03:05:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 1915. [2020-04-18 03:05:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2020-04-18 03:05:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 4285 transitions. [2020-04-18 03:05:29,270 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 4285 transitions. Word has length 15 [2020-04-18 03:05:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:29,270 INFO L479 AbstractCegarLoop]: Abstraction has 1915 states and 4285 transitions. [2020-04-18 03:05:29,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-18 03:05:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 4285 transitions. [2020-04-18 03:05:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:29,271 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:29,272 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:29,272 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:29,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1836536300, now seen corresponding path program 8 times [2020-04-18 03:05:29,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:29,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996939699] [2020-04-18 03:05:29,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:29,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996939699] [2020-04-18 03:05:29,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:29,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:05:29,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741603720] [2020-04-18 03:05:29,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:05:29,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:29,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:05:29,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:05:29,630 INFO L87 Difference]: Start difference. First operand 1915 states and 4285 transitions. Second operand 14 states. [2020-04-18 03:05:31,392 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2020-04-18 03:05:34,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:34,137 INFO L93 Difference]: Finished difference Result 2873 states and 6372 transitions. [2020-04-18 03:05:34,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-04-18 03:05:34,138 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-18 03:05:34,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:34,141 INFO L225 Difference]: With dead ends: 2873 [2020-04-18 03:05:34,141 INFO L226 Difference]: Without dead ends: 2873 [2020-04-18 03:05:34,142 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=381, Invalid=879, Unknown=0, NotChecked=0, Total=1260 [2020-04-18 03:05:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-04-18 03:05:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1898. [2020-04-18 03:05:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-04-18 03:05:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 4243 transitions. [2020-04-18 03:05:34,174 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 4243 transitions. Word has length 15 [2020-04-18 03:05:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:34,175 INFO L479 AbstractCegarLoop]: Abstraction has 1898 states and 4243 transitions. [2020-04-18 03:05:34,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:05:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 4243 transitions. [2020-04-18 03:05:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:34,176 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:34,177 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:34,177 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1616206554, now seen corresponding path program 9 times [2020-04-18 03:05:34,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:34,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368307759] [2020-04-18 03:05:34,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:34,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368307759] [2020-04-18 03:05:34,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:34,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:05:34,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842424531] [2020-04-18 03:05:34,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:05:34,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:34,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:05:34,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:05:34,433 INFO L87 Difference]: Start difference. First operand 1898 states and 4243 transitions. Second operand 14 states. [2020-04-18 03:05:37,084 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2020-04-18 03:05:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:38,924 INFO L93 Difference]: Finished difference Result 2876 states and 6382 transitions. [2020-04-18 03:05:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-04-18 03:05:38,925 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-18 03:05:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:38,929 INFO L225 Difference]: With dead ends: 2876 [2020-04-18 03:05:38,929 INFO L226 Difference]: Without dead ends: 2876 [2020-04-18 03:05:38,930 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=391, Invalid=941, Unknown=0, NotChecked=0, Total=1332 [2020-04-18 03:05:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2020-04-18 03:05:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 1892. [2020-04-18 03:05:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2020-04-18 03:05:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 4230 transitions. [2020-04-18 03:05:38,962 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 4230 transitions. Word has length 15 [2020-04-18 03:05:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:38,962 INFO L479 AbstractCegarLoop]: Abstraction has 1892 states and 4230 transitions. [2020-04-18 03:05:38,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:05:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 4230 transitions. [2020-04-18 03:05:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:38,965 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:38,965 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:38,966 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:38,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1325058876, now seen corresponding path program 10 times [2020-04-18 03:05:38,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:38,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039266918] [2020-04-18 03:05:38,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:39,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039266918] [2020-04-18 03:05:39,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:39,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:05:39,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568127451] [2020-04-18 03:05:39,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:05:39,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:39,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:05:39,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:05:39,482 INFO L87 Difference]: Start difference. First operand 1892 states and 4230 transitions. Second operand 14 states. [2020-04-18 03:05:40,875 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2020-04-18 03:05:41,125 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2020-04-18 03:05:41,753 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2020-04-18 03:05:42,217 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-04-18 03:05:42,525 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2020-04-18 03:05:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:44,147 INFO L93 Difference]: Finished difference Result 2882 states and 6396 transitions. [2020-04-18 03:05:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-04-18 03:05:44,148 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-18 03:05:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:44,152 INFO L225 Difference]: With dead ends: 2882 [2020-04-18 03:05:44,152 INFO L226 Difference]: Without dead ends: 2882 [2020-04-18 03:05:44,153 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=438, Invalid=1044, Unknown=0, NotChecked=0, Total=1482 [2020-04-18 03:05:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-04-18 03:05:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1880. [2020-04-18 03:05:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1880 states. [2020-04-18 03:05:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 4203 transitions. [2020-04-18 03:05:44,184 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 4203 transitions. Word has length 15 [2020-04-18 03:05:44,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:44,184 INFO L479 AbstractCegarLoop]: Abstraction has 1880 states and 4203 transitions. [2020-04-18 03:05:44,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:05:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 4203 transitions. [2020-04-18 03:05:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:44,186 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:44,186 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:44,186 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:44,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:44,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1565899386, now seen corresponding path program 11 times [2020-04-18 03:05:44,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:44,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033178793] [2020-04-18 03:05:44,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:44,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033178793] [2020-04-18 03:05:44,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:44,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 03:05:44,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219200736] [2020-04-18 03:05:44,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-18 03:05:44,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:44,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 03:05:44,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-04-18 03:05:44,407 INFO L87 Difference]: Start difference. First operand 1880 states and 4203 transitions. Second operand 8 states. [2020-04-18 03:05:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:45,813 INFO L93 Difference]: Finished difference Result 2526 states and 5599 transitions. [2020-04-18 03:05:45,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-04-18 03:05:45,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-04-18 03:05:45,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:45,817 INFO L225 Difference]: With dead ends: 2526 [2020-04-18 03:05:45,818 INFO L226 Difference]: Without dead ends: 2526 [2020-04-18 03:05:45,818 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-04-18 03:05:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2020-04-18 03:05:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 1862. [2020-04-18 03:05:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1862 states. [2020-04-18 03:05:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 4156 transitions. [2020-04-18 03:05:45,852 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 4156 transitions. Word has length 15 [2020-04-18 03:05:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:45,852 INFO L479 AbstractCegarLoop]: Abstraction has 1862 states and 4156 transitions. [2020-04-18 03:05:45,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-18 03:05:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 4156 transitions. [2020-04-18 03:05:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:45,855 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:45,856 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:45,856 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:45,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1673100110, now seen corresponding path program 12 times [2020-04-18 03:05:45,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:45,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035073576] [2020-04-18 03:05:45,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:46,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035073576] [2020-04-18 03:05:46,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:46,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:05:46,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592204956] [2020-04-18 03:05:46,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:05:46,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:46,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:05:46,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:05:46,180 INFO L87 Difference]: Start difference. First operand 1862 states and 4156 transitions. Second operand 14 states. [2020-04-18 03:05:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:49,804 INFO L93 Difference]: Finished difference Result 2649 states and 5857 transitions. [2020-04-18 03:05:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-04-18 03:05:49,805 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-18 03:05:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:49,808 INFO L225 Difference]: With dead ends: 2649 [2020-04-18 03:05:49,809 INFO L226 Difference]: Without dead ends: 2649 [2020-04-18 03:05:49,809 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2020-04-18 03:05:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2020-04-18 03:05:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 1811. [2020-04-18 03:05:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2020-04-18 03:05:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 4023 transitions. [2020-04-18 03:05:49,834 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 4023 transitions. Word has length 15 [2020-04-18 03:05:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:49,834 INFO L479 AbstractCegarLoop]: Abstraction has 1811 states and 4023 transitions. [2020-04-18 03:05:49,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:05:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 4023 transitions. [2020-04-18 03:05:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:49,835 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:49,835 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:49,836 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1779642744, now seen corresponding path program 13 times [2020-04-18 03:05:49,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:49,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336813931] [2020-04-18 03:05:49,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:50,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336813931] [2020-04-18 03:05:50,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:50,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:05:50,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355435945] [2020-04-18 03:05:50,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:05:50,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:50,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:05:50,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:05:50,090 INFO L87 Difference]: Start difference. First operand 1811 states and 4023 transitions. Second operand 14 states. [2020-04-18 03:05:52,325 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2020-04-18 03:05:52,573 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2020-04-18 03:05:53,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:53,876 INFO L93 Difference]: Finished difference Result 2652 states and 5867 transitions. [2020-04-18 03:05:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 03:05:53,877 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-18 03:05:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:53,881 INFO L225 Difference]: With dead ends: 2652 [2020-04-18 03:05:53,881 INFO L226 Difference]: Without dead ends: 2652 [2020-04-18 03:05:53,882 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=309, Invalid=747, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 03:05:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2020-04-18 03:05:53,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 1805. [2020-04-18 03:05:53,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1805 states. [2020-04-18 03:05:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 4010 transitions. [2020-04-18 03:05:53,909 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 4010 transitions. Word has length 15 [2020-04-18 03:05:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:53,909 INFO L479 AbstractCegarLoop]: Abstraction has 1805 states and 4010 transitions. [2020-04-18 03:05:53,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:05:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 4010 transitions. [2020-04-18 03:05:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 03:05:53,910 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:53,910 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:53,911 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:53,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:53,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1161622686, now seen corresponding path program 14 times [2020-04-18 03:05:53,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:53,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602350244] [2020-04-18 03:05:53,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:54,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602350244] [2020-04-18 03:05:54,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:54,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:05:54,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128015521] [2020-04-18 03:05:54,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:05:54,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:54,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:05:54,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:05:54,531 INFO L87 Difference]: Start difference. First operand 1805 states and 4010 transitions. Second operand 14 states. [2020-04-18 03:05:56,016 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2020-04-18 03:05:56,668 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2020-04-18 03:05:56,858 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2020-04-18 03:05:57,163 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-04-18 03:05:57,490 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-04-18 03:05:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:59,385 INFO L93 Difference]: Finished difference Result 2658 states and 5881 transitions. [2020-04-18 03:05:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-04-18 03:05:59,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-18 03:05:59,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:59,389 INFO L225 Difference]: With dead ends: 2658 [2020-04-18 03:05:59,389 INFO L226 Difference]: Without dead ends: 2658 [2020-04-18 03:05:59,390 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=352, Invalid=838, Unknown=0, NotChecked=0, Total=1190 [2020-04-18 03:05:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2020-04-18 03:05:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 1792. [2020-04-18 03:05:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2020-04-18 03:05:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 3981 transitions. [2020-04-18 03:05:59,410 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 3981 transitions. Word has length 15 [2020-04-18 03:05:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:59,411 INFO L479 AbstractCegarLoop]: Abstraction has 1792 states and 3981 transitions. [2020-04-18 03:05:59,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:05:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 3981 transitions. [2020-04-18 03:05:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:05:59,412 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:59,412 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:59,412 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:59,412 INFO L82 PathProgramCache]: Analyzing trace with hash -807122092, now seen corresponding path program 1 times [2020-04-18 03:05:59,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:59,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169878468] [2020-04-18 03:05:59,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:59,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169878468] [2020-04-18 03:05:59,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:59,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:05:59,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779354671] [2020-04-18 03:05:59,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:05:59,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:59,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:05:59,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:05:59,914 INFO L87 Difference]: Start difference. First operand 1792 states and 3981 transitions. Second operand 16 states. [2020-04-18 03:06:00,802 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2020-04-18 03:06:01,238 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2020-04-18 03:06:01,377 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 53 [2020-04-18 03:06:02,384 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-04-18 03:06:02,587 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-18 03:06:02,871 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2020-04-18 03:06:03,516 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2020-04-18 03:06:04,440 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-04-18 03:06:04,813 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-18 03:06:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:06,702 INFO L93 Difference]: Finished difference Result 2937 states and 6538 transitions. [2020-04-18 03:06:06,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-04-18 03:06:06,703 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-18 03:06:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:06,707 INFO L225 Difference]: With dead ends: 2937 [2020-04-18 03:06:06,707 INFO L226 Difference]: Without dead ends: 2937 [2020-04-18 03:06:06,708 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=502, Invalid=1390, Unknown=0, NotChecked=0, Total=1892 [2020-04-18 03:06:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-04-18 03:06:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1921. [2020-04-18 03:06:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2020-04-18 03:06:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 4292 transitions. [2020-04-18 03:06:06,739 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 4292 transitions. Word has length 17 [2020-04-18 03:06:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:06,740 INFO L479 AbstractCegarLoop]: Abstraction has 1921 states and 4292 transitions. [2020-04-18 03:06:06,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:06:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 4292 transitions. [2020-04-18 03:06:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:06:06,742 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:06,742 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:06:06,742 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:06,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1564008090, now seen corresponding path program 2 times [2020-04-18 03:06:06,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:06,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189224671] [2020-04-18 03:06:06,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:07,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189224671] [2020-04-18 03:06:07,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:07,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:06:07,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306437652] [2020-04-18 03:06:07,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:06:07,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:07,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:06:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:06:07,158 INFO L87 Difference]: Start difference. First operand 1921 states and 4292 transitions. Second operand 16 states. [2020-04-18 03:06:07,998 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2020-04-18 03:06:08,431 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 54 [2020-04-18 03:06:09,304 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2020-04-18 03:06:09,771 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-04-18 03:06:09,984 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-18 03:06:10,286 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2020-04-18 03:06:10,971 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 57 [2020-04-18 03:06:11,947 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-04-18 03:06:12,333 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-18 03:06:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:14,400 INFO L93 Difference]: Finished difference Result 3060 states and 6829 transitions. [2020-04-18 03:06:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-04-18 03:06:14,404 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-18 03:06:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:14,408 INFO L225 Difference]: With dead ends: 3060 [2020-04-18 03:06:14,408 INFO L226 Difference]: Without dead ends: 3060 [2020-04-18 03:06:14,409 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=513, Invalid=1467, Unknown=0, NotChecked=0, Total=1980 [2020-04-18 03:06:14,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2020-04-18 03:06:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 1922. [2020-04-18 03:06:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2020-04-18 03:06:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 4294 transitions. [2020-04-18 03:06:14,431 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 4294 transitions. Word has length 17 [2020-04-18 03:06:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:14,431 INFO L479 AbstractCegarLoop]: Abstraction has 1922 states and 4294 transitions. [2020-04-18 03:06:14,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:06:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 4294 transitions. [2020-04-18 03:06:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:06:14,433 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:14,433 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:06:14,433 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1824797056, now seen corresponding path program 3 times [2020-04-18 03:06:14,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:14,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496837236] [2020-04-18 03:06:14,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:14,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496837236] [2020-04-18 03:06:14,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:14,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 03:06:14,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802002666] [2020-04-18 03:06:14,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:06:14,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:06:14,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:06:14,860 INFO L87 Difference]: Start difference. First operand 1922 states and 4294 transitions. Second operand 13 states. [2020-04-18 03:06:15,597 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2020-04-18 03:06:16,399 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2020-04-18 03:06:16,581 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-04-18 03:06:16,772 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-04-18 03:06:17,495 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-04-18 03:06:18,339 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2020-04-18 03:06:18,702 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 60 [2020-04-18 03:06:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:20,592 INFO L93 Difference]: Finished difference Result 3049 states and 6806 transitions. [2020-04-18 03:06:20,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-04-18 03:06:20,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2020-04-18 03:06:20,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:20,596 INFO L225 Difference]: With dead ends: 3049 [2020-04-18 03:06:20,596 INFO L226 Difference]: Without dead ends: 3049 [2020-04-18 03:06:20,597 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=333, Invalid=927, Unknown=0, NotChecked=0, Total=1260 [2020-04-18 03:06:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2020-04-18 03:06:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 1918. [2020-04-18 03:06:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1918 states. [2020-04-18 03:06:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 4285 transitions. [2020-04-18 03:06:20,635 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 4285 transitions. Word has length 17 [2020-04-18 03:06:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:20,636 INFO L479 AbstractCegarLoop]: Abstraction has 1918 states and 4285 transitions. [2020-04-18 03:06:20,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:06:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 4285 transitions. [2020-04-18 03:06:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:06:20,637 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:20,637 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:06:20,637 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:20,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1515180442, now seen corresponding path program 4 times [2020-04-18 03:06:20,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:20,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695850327] [2020-04-18 03:06:20,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:21,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695850327] [2020-04-18 03:06:21,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:21,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 03:06:21,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541676867] [2020-04-18 03:06:21,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:06:21,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:21,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:06:21,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:06:21,020 INFO L87 Difference]: Start difference. First operand 1918 states and 4285 transitions. Second operand 13 states. [2020-04-18 03:06:22,664 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-04-18 03:06:22,843 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-04-18 03:06:23,425 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-04-18 03:06:23,726 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2020-04-18 03:06:26,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:26,264 INFO L93 Difference]: Finished difference Result 3298 states and 7398 transitions. [2020-04-18 03:06:26,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-04-18 03:06:26,265 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2020-04-18 03:06:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:26,269 INFO L225 Difference]: With dead ends: 3298 [2020-04-18 03:06:26,269 INFO L226 Difference]: Without dead ends: 3298 [2020-04-18 03:06:26,270 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=344, Invalid=1062, Unknown=0, NotChecked=0, Total=1406 [2020-04-18 03:06:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2020-04-18 03:06:26,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 1940. [2020-04-18 03:06:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1940 states. [2020-04-18 03:06:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 4333 transitions. [2020-04-18 03:06:26,296 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 4333 transitions. Word has length 17 [2020-04-18 03:06:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:26,297 INFO L479 AbstractCegarLoop]: Abstraction has 1940 states and 4333 transitions. [2020-04-18 03:06:26,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:06:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 4333 transitions. [2020-04-18 03:06:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:06:26,298 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:26,298 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:06:26,298 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:26,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:26,299 INFO L82 PathProgramCache]: Analyzing trace with hash -784981494, now seen corresponding path program 5 times [2020-04-18 03:06:26,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:26,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832814511] [2020-04-18 03:06:26,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:26,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832814511] [2020-04-18 03:06:26,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:26,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:06:26,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776971117] [2020-04-18 03:06:26,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:26,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:26,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:26,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:26,688 INFO L87 Difference]: Start difference. First operand 1940 states and 4333 transitions. Second operand 14 states. [2020-04-18 03:06:27,789 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 51 [2020-04-18 03:06:28,375 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-04-18 03:06:28,544 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-04-18 03:06:28,691 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2020-04-18 03:06:29,589 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2020-04-18 03:06:30,575 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 63 [2020-04-18 03:06:32,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:32,195 INFO L93 Difference]: Finished difference Result 3429 states and 7703 transitions. [2020-04-18 03:06:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-04-18 03:06:32,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2020-04-18 03:06:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:32,200 INFO L225 Difference]: With dead ends: 3429 [2020-04-18 03:06:32,200 INFO L226 Difference]: Without dead ends: 3429 [2020-04-18 03:06:32,201 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=399, Invalid=1241, Unknown=0, NotChecked=0, Total=1640 [2020-04-18 03:06:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2020-04-18 03:06:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 1940. [2020-04-18 03:06:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1940 states. [2020-04-18 03:06:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 4333 transitions. [2020-04-18 03:06:32,225 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 4333 transitions. Word has length 17 [2020-04-18 03:06:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:32,225 INFO L479 AbstractCegarLoop]: Abstraction has 1940 states and 4333 transitions. [2020-04-18 03:06:32,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 4333 transitions. [2020-04-18 03:06:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:06:32,226 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:32,227 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:06:32,227 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:32,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:32,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1082098788, now seen corresponding path program 6 times [2020-04-18 03:06:32,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:32,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092361714] [2020-04-18 03:06:32,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:32,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092361714] [2020-04-18 03:06:32,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:32,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 03:06:32,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874944287] [2020-04-18 03:06:32,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:06:32,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:32,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:06:32,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:06:32,619 INFO L87 Difference]: Start difference. First operand 1940 states and 4333 transitions. Second operand 13 states. [2020-04-18 03:06:34,280 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-04-18 03:06:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:38,271 INFO L93 Difference]: Finished difference Result 2808 states and 6277 transitions. [2020-04-18 03:06:38,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-04-18 03:06:38,272 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2020-04-18 03:06:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:38,276 INFO L225 Difference]: With dead ends: 2808 [2020-04-18 03:06:38,276 INFO L226 Difference]: Without dead ends: 2808 [2020-04-18 03:06:38,277 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=303, Invalid=957, Unknown=0, NotChecked=0, Total=1260 [2020-04-18 03:06:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2020-04-18 03:06:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 1940. [2020-04-18 03:06:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1940 states. [2020-04-18 03:06:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 4333 transitions. [2020-04-18 03:06:38,298 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 4333 transitions. Word has length 17 [2020-04-18 03:06:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:38,299 INFO L479 AbstractCegarLoop]: Abstraction has 1940 states and 4333 transitions. [2020-04-18 03:06:38,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:06:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 4333 transitions. [2020-04-18 03:06:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:06:38,300 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:38,300 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:06:38,300 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:38,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1532498778, now seen corresponding path program 7 times [2020-04-18 03:06:38,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:38,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691627278] [2020-04-18 03:06:38,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:38,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691627278] [2020-04-18 03:06:38,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:38,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:06:38,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830739040] [2020-04-18 03:06:38,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:06:38,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:06:38,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:06:38,668 INFO L87 Difference]: Start difference. First operand 1940 states and 4333 transitions. Second operand 16 states. [2020-04-18 03:06:39,898 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 53 [2020-04-18 03:06:40,620 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2020-04-18 03:06:40,940 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-04-18 03:06:41,309 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2020-04-18 03:06:41,839 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 47 [2020-04-18 03:06:42,121 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-04-18 03:06:43,013 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2020-04-18 03:06:43,347 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2020-04-18 03:06:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:45,183 INFO L93 Difference]: Finished difference Result 2849 states and 6363 transitions. [2020-04-18 03:06:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-04-18 03:06:45,184 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-18 03:06:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:45,188 INFO L225 Difference]: With dead ends: 2849 [2020-04-18 03:06:45,188 INFO L226 Difference]: Without dead ends: 2849 [2020-04-18 03:06:45,189 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=445, Invalid=1361, Unknown=0, NotChecked=0, Total=1806 [2020-04-18 03:06:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2020-04-18 03:06:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 1941. [2020-04-18 03:06:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2020-04-18 03:06:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 4335 transitions. [2020-04-18 03:06:45,229 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 4335 transitions. Word has length 17 [2020-04-18 03:06:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:45,230 INFO L479 AbstractCegarLoop]: Abstraction has 1941 states and 4335 transitions. [2020-04-18 03:06:45,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:06:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 4335 transitions. [2020-04-18 03:06:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:06:45,231 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:45,231 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:06:45,232 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:45,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:45,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1793287744, now seen corresponding path program 8 times [2020-04-18 03:06:45,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:45,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872982246] [2020-04-18 03:06:45,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:45,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872982246] [2020-04-18 03:06:45,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:45,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 03:06:45,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155348322] [2020-04-18 03:06:45,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:06:45,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:45,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:06:45,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:06:45,726 INFO L87 Difference]: Start difference. First operand 1941 states and 4335 transitions. Second operand 13 states. [2020-04-18 03:06:47,235 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2020-04-18 03:06:47,400 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-04-18 03:06:47,606 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-04-18 03:06:48,944 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 [2020-04-18 03:06:49,262 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2020-04-18 03:06:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:50,851 INFO L93 Difference]: Finished difference Result 2949 states and 6605 transitions. [2020-04-18 03:06:50,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-04-18 03:06:50,852 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2020-04-18 03:06:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:50,856 INFO L225 Difference]: With dead ends: 2949 [2020-04-18 03:06:50,856 INFO L226 Difference]: Without dead ends: 2949 [2020-04-18 03:06:50,857 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2020-04-18 03:06:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-04-18 03:06:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1940. [2020-04-18 03:06:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1940 states. [2020-04-18 03:06:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 4333 transitions. [2020-04-18 03:06:50,880 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 4333 transitions. Word has length 17 [2020-04-18 03:06:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:50,881 INFO L479 AbstractCegarLoop]: Abstraction has 1940 states and 4333 transitions. [2020-04-18 03:06:50,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:06:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 4333 transitions. [2020-04-18 03:06:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:06:50,882 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:50,882 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:06:50,882 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:50,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash -95542282, now seen corresponding path program 9 times [2020-04-18 03:06:50,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:50,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848114696] [2020-04-18 03:06:50,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:51,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848114696] [2020-04-18 03:06:51,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:51,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:06:51,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916454316] [2020-04-18 03:06:51,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:06:51,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:51,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:06:51,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:06:51,494 INFO L87 Difference]: Start difference. First operand 1940 states and 4333 transitions. Second operand 16 states. [2020-04-18 03:06:52,575 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 53 [2020-04-18 03:06:53,498 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2020-04-18 03:06:53,762 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2020-04-18 03:06:54,067 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 50 [2020-04-18 03:06:54,548 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 56 [2020-04-18 03:06:54,828 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2020-04-18 03:06:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:56,941 INFO L93 Difference]: Finished difference Result 3456 states and 7706 transitions. [2020-04-18 03:06:56,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-04-18 03:06:56,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-18 03:06:56,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:56,946 INFO L225 Difference]: With dead ends: 3456 [2020-04-18 03:06:56,947 INFO L226 Difference]: Without dead ends: 3456 [2020-04-18 03:06:56,947 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2020-04-18 03:06:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3456 states. [2020-04-18 03:06:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3456 to 1979. [2020-04-18 03:06:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2020-04-18 03:06:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 4436 transitions. [2020-04-18 03:06:56,972 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 4436 transitions. Word has length 17 [2020-04-18 03:06:56,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:56,973 INFO L479 AbstractCegarLoop]: Abstraction has 1979 states and 4436 transitions. [2020-04-18 03:06:56,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:06:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 4436 transitions. [2020-04-18 03:06:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:06:56,974 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:56,974 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:06:56,974 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:56,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:56,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2019379396, now seen corresponding path program 10 times [2020-04-18 03:06:56,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:56,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128063291] [2020-04-18 03:06:56,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:57,481 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128063291] [2020-04-18 03:06:57,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:57,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:06:57,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059151040] [2020-04-18 03:06:57,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:06:57,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:57,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:06:57,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:06:57,483 INFO L87 Difference]: Start difference. First operand 1979 states and 4436 transitions. Second operand 16 states. [2020-04-18 03:06:58,219 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2020-04-18 03:06:58,601 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2020-04-18 03:06:59,309 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2020-04-18 03:06:59,596 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2020-04-18 03:06:59,853 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2020-04-18 03:07:00,150 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 50 [2020-04-18 03:07:00,342 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 48 [2020-04-18 03:07:00,638 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 56 [2020-04-18 03:07:00,905 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2020-04-18 03:07:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:02,893 INFO L93 Difference]: Finished difference Result 3543 states and 7922 transitions. [2020-04-18 03:07:02,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-04-18 03:07:02,894 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-18 03:07:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:02,898 INFO L225 Difference]: With dead ends: 3543 [2020-04-18 03:07:02,899 INFO L226 Difference]: Without dead ends: 3543 [2020-04-18 03:07:02,899 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=413, Invalid=1147, Unknown=0, NotChecked=0, Total=1560 [2020-04-18 03:07:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2020-04-18 03:07:02,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 1980. [2020-04-18 03:07:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1980 states. [2020-04-18 03:07:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 4438 transitions. [2020-04-18 03:07:02,922 INFO L78 Accepts]: Start accepts. Automaton has 1980 states and 4438 transitions. Word has length 17 [2020-04-18 03:07:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:02,922 INFO L479 AbstractCegarLoop]: Abstraction has 1980 states and 4438 transitions. [2020-04-18 03:07:02,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:07:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 4438 transitions. [2020-04-18 03:07:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:07:02,923 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:02,923 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:07:02,924 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:02,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:02,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1758590430, now seen corresponding path program 11 times [2020-04-18 03:07:02,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:02,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960058957] [2020-04-18 03:07:02,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:03,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960058957] [2020-04-18 03:07:03,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:03,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:07:03,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649826203] [2020-04-18 03:07:03,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 03:07:03,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:03,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 03:07:03,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-04-18 03:07:03,266 INFO L87 Difference]: Start difference. First operand 1980 states and 4438 transitions. Second operand 15 states. [2020-04-18 03:07:03,940 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2020-04-18 03:07:04,315 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2020-04-18 03:07:05,056 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2020-04-18 03:07:05,347 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2020-04-18 03:07:05,613 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-18 03:07:06,041 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2020-04-18 03:07:06,622 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-04-18 03:07:06,967 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-18 03:07:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:09,346 INFO L93 Difference]: Finished difference Result 3525 states and 7885 transitions. [2020-04-18 03:07:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-04-18 03:07:09,347 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-18 03:07:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:09,352 INFO L225 Difference]: With dead ends: 3525 [2020-04-18 03:07:09,352 INFO L226 Difference]: Without dead ends: 3525 [2020-04-18 03:07:09,352 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=432, Invalid=1208, Unknown=0, NotChecked=0, Total=1640 [2020-04-18 03:07:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2020-04-18 03:07:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 1975. [2020-04-18 03:07:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2020-04-18 03:07:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 4426 transitions. [2020-04-18 03:07:09,379 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 4426 transitions. Word has length 17 [2020-04-18 03:07:09,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:09,379 INFO L479 AbstractCegarLoop]: Abstraction has 1975 states and 4426 transitions. [2020-04-18 03:07:09,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 03:07:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 4426 transitions. [2020-04-18 03:07:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:07:09,381 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:09,381 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:07:09,381 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:09,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:09,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1947153644, now seen corresponding path program 12 times [2020-04-18 03:07:09,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:09,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376207387] [2020-04-18 03:07:09,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:10,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376207387] [2020-04-18 03:07:10,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:10,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:07:10,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950815342] [2020-04-18 03:07:10,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:07:10,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:10,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:07:10,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:07:10,020 INFO L87 Difference]: Start difference. First operand 1975 states and 4426 transitions. Second operand 16 states. [2020-04-18 03:07:10,490 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2020-04-18 03:07:10,781 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 53 [2020-04-18 03:07:11,521 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2020-04-18 03:07:11,751 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2020-04-18 03:07:12,013 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 50 [2020-04-18 03:07:12,453 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 56 [2020-04-18 03:07:12,722 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2020-04-18 03:07:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:14,343 INFO L93 Difference]: Finished difference Result 3204 states and 7145 transitions. [2020-04-18 03:07:14,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-04-18 03:07:14,343 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-18 03:07:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:14,348 INFO L225 Difference]: With dead ends: 3204 [2020-04-18 03:07:14,348 INFO L226 Difference]: Without dead ends: 3204 [2020-04-18 03:07:14,349 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2020-04-18 03:07:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2020-04-18 03:07:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 1924. [2020-04-18 03:07:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2020-04-18 03:07:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 4293 transitions. [2020-04-18 03:07:14,372 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 4293 transitions. Word has length 17 [2020-04-18 03:07:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:14,372 INFO L479 AbstractCegarLoop]: Abstraction has 1924 states and 4293 transitions. [2020-04-18 03:07:14,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:07:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 4293 transitions. [2020-04-18 03:07:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:07:14,373 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:14,373 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:07:14,373 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:14,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:14,373 INFO L82 PathProgramCache]: Analyzing trace with hash 423976538, now seen corresponding path program 13 times [2020-04-18 03:07:14,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:14,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921471426] [2020-04-18 03:07:14,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:14,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921471426] [2020-04-18 03:07:14,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:14,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:07:14,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708293479] [2020-04-18 03:07:14,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:07:14,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:14,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:07:14,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:07:14,874 INFO L87 Difference]: Start difference. First operand 1924 states and 4293 transitions. Second operand 16 states. [2020-04-18 03:07:15,339 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2020-04-18 03:07:15,629 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2020-04-18 03:07:16,505 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2020-04-18 03:07:16,745 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2020-04-18 03:07:17,031 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 50 [2020-04-18 03:07:17,494 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 56 [2020-04-18 03:07:17,788 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2020-04-18 03:07:19,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:19,625 INFO L93 Difference]: Finished difference Result 3291 states and 7361 transitions. [2020-04-18 03:07:19,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-04-18 03:07:19,625 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-18 03:07:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:19,630 INFO L225 Difference]: With dead ends: 3291 [2020-04-18 03:07:19,630 INFO L226 Difference]: Without dead ends: 3291 [2020-04-18 03:07:19,631 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=331, Invalid=929, Unknown=0, NotChecked=0, Total=1260 [2020-04-18 03:07:19,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2020-04-18 03:07:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 1918. [2020-04-18 03:07:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1918 states. [2020-04-18 03:07:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 4280 transitions. [2020-04-18 03:07:19,657 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 4280 transitions. Word has length 17 [2020-04-18 03:07:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:19,657 INFO L479 AbstractCegarLoop]: Abstraction has 1918 states and 4280 transitions. [2020-04-18 03:07:19,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:07:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 4280 transitions. [2020-04-18 03:07:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:07:19,658 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:19,658 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:07:19,658 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:19,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:19,658 INFO L82 PathProgramCache]: Analyzing trace with hash 684765504, now seen corresponding path program 14 times [2020-04-18 03:07:19,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:19,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424635456] [2020-04-18 03:07:19,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:20,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424635456] [2020-04-18 03:07:20,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:20,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:07:20,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880238430] [2020-04-18 03:07:20,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 03:07:20,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:20,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 03:07:20,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-04-18 03:07:20,133 INFO L87 Difference]: Start difference. First operand 1918 states and 4280 transitions. Second operand 15 states. [2020-04-18 03:07:21,095 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2020-04-18 03:07:22,057 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2020-04-18 03:07:22,319 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-18 03:07:22,757 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2020-04-18 03:07:23,286 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-04-18 03:07:23,605 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-18 03:07:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:26,123 INFO L93 Difference]: Finished difference Result 3259 states and 7292 transitions. [2020-04-18 03:07:26,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-04-18 03:07:26,124 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-18 03:07:26,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:26,129 INFO L225 Difference]: With dead ends: 3259 [2020-04-18 03:07:26,129 INFO L226 Difference]: Without dead ends: 3259 [2020-04-18 03:07:26,130 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=348, Invalid=984, Unknown=0, NotChecked=0, Total=1332 [2020-04-18 03:07:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2020-04-18 03:07:26,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 1891. [2020-04-18 03:07:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2020-04-18 03:07:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 4219 transitions. [2020-04-18 03:07:26,155 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 4219 transitions. Word has length 17 [2020-04-18 03:07:26,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:26,155 INFO L479 AbstractCegarLoop]: Abstraction has 1891 states and 4219 transitions. [2020-04-18 03:07:26,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 03:07:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 4219 transitions. [2020-04-18 03:07:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:07:26,156 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:26,156 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:07:26,156 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:26,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:26,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1634243019, now seen corresponding path program 1 times [2020-04-18 03:07:26,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:26,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812965552] [2020-04-18 03:07:26,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:26,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812965552] [2020-04-18 03:07:26,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:26,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 03:07:26,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776718733] [2020-04-18 03:07:26,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 03:07:26,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:26,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 03:07:26,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-04-18 03:07:26,270 INFO L87 Difference]: Start difference. First operand 1891 states and 4219 transitions. Second operand 7 states. [2020-04-18 03:07:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:27,141 INFO L93 Difference]: Finished difference Result 2142 states and 4765 transitions. [2020-04-18 03:07:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-18 03:07:27,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-04-18 03:07:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:27,145 INFO L225 Difference]: With dead ends: 2142 [2020-04-18 03:07:27,146 INFO L226 Difference]: Without dead ends: 2142 [2020-04-18 03:07:27,146 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-04-18 03:07:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2020-04-18 03:07:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1982. [2020-04-18 03:07:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2020-04-18 03:07:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4429 transitions. [2020-04-18 03:07:27,172 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4429 transitions. Word has length 17 [2020-04-18 03:07:27,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:27,173 INFO L479 AbstractCegarLoop]: Abstraction has 1982 states and 4429 transitions. [2020-04-18 03:07:27,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 03:07:27,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4429 transitions. [2020-04-18 03:07:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 03:07:27,174 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:27,174 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:07:27,174 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:27,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:27,175 INFO L82 PathProgramCache]: Analyzing trace with hash -183833368, now seen corresponding path program 1 times [2020-04-18 03:07:27,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:27,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171086406] [2020-04-18 03:07:27,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:27,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:27,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171086406] [2020-04-18 03:07:27,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:27,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:07:27,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420879659] [2020-04-18 03:07:27,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 03:07:27,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:27,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 03:07:27,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2020-04-18 03:07:27,425 INFO L87 Difference]: Start difference. First operand 1982 states and 4429 transitions. Second operand 15 states. [2020-04-18 03:07:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:31,751 INFO L93 Difference]: Finished difference Result 2611 states and 5761 transitions. [2020-04-18 03:07:31,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-04-18 03:07:31,751 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-18 03:07:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:31,755 INFO L225 Difference]: With dead ends: 2611 [2020-04-18 03:07:31,756 INFO L226 Difference]: Without dead ends: 2611 [2020-04-18 03:07:31,756 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=619, Invalid=1451, Unknown=0, NotChecked=0, Total=2070 [2020-04-18 03:07:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2020-04-18 03:07:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2002. [2020-04-18 03:07:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2020-04-18 03:07:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4473 transitions. [2020-04-18 03:07:31,787 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4473 transitions. Word has length 18 [2020-04-18 03:07:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:31,787 INFO L479 AbstractCegarLoop]: Abstraction has 2002 states and 4473 transitions. [2020-04-18 03:07:31,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 03:07:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4473 transitions. [2020-04-18 03:07:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 03:07:31,788 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:31,788 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:07:31,788 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1298599674, now seen corresponding path program 2 times [2020-04-18 03:07:31,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:31,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569347557] [2020-04-18 03:07:31,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:32,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569347557] [2020-04-18 03:07:32,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:32,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:07:32,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282995668] [2020-04-18 03:07:32,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 03:07:32,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:32,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 03:07:32,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-04-18 03:07:32,053 INFO L87 Difference]: Start difference. First operand 2002 states and 4473 transitions. Second operand 15 states. [2020-04-18 03:07:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:37,292 INFO L93 Difference]: Finished difference Result 2666 states and 5880 transitions. [2020-04-18 03:07:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-04-18 03:07:37,293 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-18 03:07:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:37,296 INFO L225 Difference]: With dead ends: 2666 [2020-04-18 03:07:37,297 INFO L226 Difference]: Without dead ends: 2666 [2020-04-18 03:07:37,297 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=689, Invalid=1663, Unknown=0, NotChecked=0, Total=2352 [2020-04-18 03:07:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2020-04-18 03:07:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2009. [2020-04-18 03:07:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2020-04-18 03:07:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 4489 transitions. [2020-04-18 03:07:37,320 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 4489 transitions. Word has length 18 [2020-04-18 03:07:37,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:37,320 INFO L479 AbstractCegarLoop]: Abstraction has 2009 states and 4489 transitions. [2020-04-18 03:07:37,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 03:07:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 4489 transitions. [2020-04-18 03:07:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 03:07:37,321 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:37,322 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:07:37,322 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:37,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:37,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1858161560, now seen corresponding path program 3 times [2020-04-18 03:07:37,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:37,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724674507] [2020-04-18 03:07:37,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:37,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724674507] [2020-04-18 03:07:37,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:37,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:07:37,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875700419] [2020-04-18 03:07:37,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 03:07:37,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:37,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 03:07:37,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-04-18 03:07:37,603 INFO L87 Difference]: Start difference. First operand 2009 states and 4489 transitions. Second operand 15 states. [2020-04-18 03:07:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:42,921 INFO L93 Difference]: Finished difference Result 2586 states and 5710 transitions. [2020-04-18 03:07:42,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-04-18 03:07:42,921 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-18 03:07:42,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:42,925 INFO L225 Difference]: With dead ends: 2586 [2020-04-18 03:07:42,925 INFO L226 Difference]: Without dead ends: 2586 [2020-04-18 03:07:42,926 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=541, Invalid=1351, Unknown=0, NotChecked=0, Total=1892 [2020-04-18 03:07:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2020-04-18 03:07:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2016. [2020-04-18 03:07:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2016 states. [2020-04-18 03:07:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 4505 transitions. [2020-04-18 03:07:42,948 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 4505 transitions. Word has length 18 [2020-04-18 03:07:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:42,948 INFO L479 AbstractCegarLoop]: Abstraction has 2016 states and 4505 transitions. [2020-04-18 03:07:42,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 03:07:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 4505 transitions. [2020-04-18 03:07:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 03:07:42,949 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:42,949 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:07:42,949 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:42,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash -227661242, now seen corresponding path program 4 times [2020-04-18 03:07:42,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:42,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021873078] [2020-04-18 03:07:42,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:43,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021873078] [2020-04-18 03:07:43,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:43,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:07:43,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624767264] [2020-04-18 03:07:43,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 03:07:43,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:43,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 03:07:43,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-04-18 03:07:43,260 INFO L87 Difference]: Start difference. First operand 2016 states and 4505 transitions. Second operand 15 states. [2020-04-18 03:07:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:47,849 INFO L93 Difference]: Finished difference Result 2623 states and 5789 transitions. [2020-04-18 03:07:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-04-18 03:07:47,849 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-18 03:07:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:47,853 INFO L225 Difference]: With dead ends: 2623 [2020-04-18 03:07:47,853 INFO L226 Difference]: Without dead ends: 2623 [2020-04-18 03:07:47,854 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=506, Invalid=1216, Unknown=0, NotChecked=0, Total=1722 [2020-04-18 03:07:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2020-04-18 03:07:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2023. [2020-04-18 03:07:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2020-04-18 03:07:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 4521 transitions. [2020-04-18 03:07:47,879 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 4521 transitions. Word has length 18 [2020-04-18 03:07:47,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:47,879 INFO L479 AbstractCegarLoop]: Abstraction has 2023 states and 4521 transitions. [2020-04-18 03:07:47,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 03:07:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 4521 transitions. [2020-04-18 03:07:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 03:07:47,880 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:47,880 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:07:47,880 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:47,880 INFO L82 PathProgramCache]: Analyzing trace with hash 10962920, now seen corresponding path program 5 times [2020-04-18 03:07:47,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:47,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867657209] [2020-04-18 03:07:47,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:48,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867657209] [2020-04-18 03:07:48,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:48,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:07:48,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097680759] [2020-04-18 03:07:48,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 03:07:48,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:48,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 03:07:48,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-04-18 03:07:48,182 INFO L87 Difference]: Start difference. First operand 2023 states and 4521 transitions. Second operand 15 states. [2020-04-18 03:07:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:52,613 INFO L93 Difference]: Finished difference Result 2663 states and 5879 transitions. [2020-04-18 03:07:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-04-18 03:07:52,613 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-18 03:07:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:52,617 INFO L225 Difference]: With dead ends: 2663 [2020-04-18 03:07:52,617 INFO L226 Difference]: Without dead ends: 2663 [2020-04-18 03:07:52,618 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=505, Invalid=1217, Unknown=0, NotChecked=0, Total=1722 [2020-04-18 03:07:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2020-04-18 03:07:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2030. [2020-04-18 03:07:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2020-04-18 03:07:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 4537 transitions. [2020-04-18 03:07:52,645 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 4537 transitions. Word has length 18 [2020-04-18 03:07:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:52,645 INFO L479 AbstractCegarLoop]: Abstraction has 2030 states and 4537 transitions. [2020-04-18 03:07:52,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 03:07:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 4537 transitions. [2020-04-18 03:07:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 03:07:52,646 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:52,646 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:07:52,646 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:52,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:52,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1160616442, now seen corresponding path program 6 times [2020-04-18 03:07:52,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:52,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768804567] [2020-04-18 03:07:52,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:52,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768804567] [2020-04-18 03:07:52,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:52,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:07:52,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585370168] [2020-04-18 03:07:52,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 03:07:52,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:52,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 03:07:52,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-04-18 03:07:52,950 INFO L87 Difference]: Start difference. First operand 2030 states and 4537 transitions. Second operand 15 states. [2020-04-18 03:07:57,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:57,710 INFO L93 Difference]: Finished difference Result 2729 states and 6013 transitions. [2020-04-18 03:07:57,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-04-18 03:07:57,710 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-18 03:07:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:57,714 INFO L225 Difference]: With dead ends: 2729 [2020-04-18 03:07:57,714 INFO L226 Difference]: Without dead ends: 2729 [2020-04-18 03:07:57,715 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=582, Invalid=1398, Unknown=0, NotChecked=0, Total=1980 [2020-04-18 03:07:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2020-04-18 03:07:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2037. [2020-04-18 03:07:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2020-04-18 03:07:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 4552 transitions. [2020-04-18 03:07:57,736 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 4552 transitions. Word has length 18 [2020-04-18 03:07:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:57,737 INFO L479 AbstractCegarLoop]: Abstraction has 2037 states and 4552 transitions. [2020-04-18 03:07:57,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 03:07:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 4552 transitions. [2020-04-18 03:07:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 03:07:57,738 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:57,738 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:07:57,738 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:57,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1878182696, now seen corresponding path program 7 times [2020-04-18 03:07:57,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:57,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118692418] [2020-04-18 03:07:57,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:58,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118692418] [2020-04-18 03:07:58,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:58,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:07:58,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268489745] [2020-04-18 03:07:58,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 03:07:58,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:58,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 03:07:58,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-04-18 03:07:58,005 INFO L87 Difference]: Start difference. First operand 2037 states and 4552 transitions. Second operand 15 states. [2020-04-18 03:08:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:01,888 INFO L93 Difference]: Finished difference Result 2461 states and 5445 transitions. [2020-04-18 03:08:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-04-18 03:08:01,888 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-18 03:08:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:01,892 INFO L225 Difference]: With dead ends: 2461 [2020-04-18 03:08:01,892 INFO L226 Difference]: Without dead ends: 2461 [2020-04-18 03:08:01,893 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2020-04-18 03:08:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2020-04-18 03:08:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2009. [2020-04-18 03:08:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2020-04-18 03:08:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 4489 transitions. [2020-04-18 03:08:01,915 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 4489 transitions. Word has length 18 [2020-04-18 03:08:01,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:01,915 INFO L479 AbstractCegarLoop]: Abstraction has 2009 states and 4489 transitions. [2020-04-18 03:08:01,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 03:08:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 4489 transitions. [2020-04-18 03:08:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 03:08:01,916 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:01,916 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:08:01,916 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:01,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:01,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1681614593, now seen corresponding path program 1 times [2020-04-18 03:08:01,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:01,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876739482] [2020-04-18 03:08:01,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:02,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876739482] [2020-04-18 03:08:02,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:02,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:08:02,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295286720] [2020-04-18 03:08:02,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 03:08:02,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:02,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 03:08:02,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-04-18 03:08:02,508 INFO L87 Difference]: Start difference. First operand 2009 states and 4489 transitions. Second operand 15 states. [2020-04-18 03:08:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:05,721 INFO L93 Difference]: Finished difference Result 3566 states and 7947 transitions. [2020-04-18 03:08:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-04-18 03:08:05,722 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-18 03:08:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:05,727 INFO L225 Difference]: With dead ends: 3566 [2020-04-18 03:08:05,728 INFO L226 Difference]: Without dead ends: 3566 [2020-04-18 03:08:05,728 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2020-04-18 03:08:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2020-04-18 03:08:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 1999. [2020-04-18 03:08:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2020-04-18 03:08:05,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 4458 transitions. [2020-04-18 03:08:05,754 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 4458 transitions. Word has length 18 [2020-04-18 03:08:05,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:05,754 INFO L479 AbstractCegarLoop]: Abstraction has 1999 states and 4458 transitions. [2020-04-18 03:08:05,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 03:08:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 4458 transitions. [2020-04-18 03:08:05,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 03:08:05,755 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:05,755 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:08:05,755 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:05,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1830056629, now seen corresponding path program 1 times [2020-04-18 03:08:05,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:05,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889621360] [2020-04-18 03:08:05,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:06,985 WARN L192 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 74 [2020-04-18 03:08:07,289 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2020-04-18 03:08:07,649 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2020-04-18 03:08:07,846 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2020-04-18 03:08:07,987 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2020-04-18 03:08:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:08,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889621360] [2020-04-18 03:08:08,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:08,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-04-18 03:08:08,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386605472] [2020-04-18 03:08:08,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-18 03:08:08,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:08,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 03:08:08,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2020-04-18 03:08:08,220 INFO L87 Difference]: Start difference. First operand 1999 states and 4458 transitions. Second operand 19 states. [2020-04-18 03:08:10,452 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2020-04-18 03:08:10,977 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 85 [2020-04-18 03:08:11,563 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2020-04-18 03:08:12,450 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-04-18 03:08:12,714 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2020-04-18 03:08:13,046 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2020-04-18 03:08:13,279 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2020-04-18 03:08:13,603 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-04-18 03:08:14,149 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 88 [2020-04-18 03:08:14,554 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2020-04-18 03:08:14,924 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2020-04-18 03:08:18,433 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 38 [2020-04-18 03:08:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:19,058 INFO L93 Difference]: Finished difference Result 2867 states and 6366 transitions. [2020-04-18 03:08:19,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-04-18 03:08:19,059 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2020-04-18 03:08:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:19,063 INFO L225 Difference]: With dead ends: 2867 [2020-04-18 03:08:19,063 INFO L226 Difference]: Without dead ends: 2867 [2020-04-18 03:08:19,064 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=528, Invalid=2334, Unknown=0, NotChecked=0, Total=2862 [2020-04-18 03:08:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2020-04-18 03:08:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2079. [2020-04-18 03:08:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2020-04-18 03:08:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 4650 transitions. [2020-04-18 03:08:19,086 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 4650 transitions. Word has length 20 [2020-04-18 03:08:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:19,086 INFO L479 AbstractCegarLoop]: Abstraction has 2079 states and 4650 transitions. [2020-04-18 03:08:19,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-18 03:08:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 4650 transitions. [2020-04-18 03:08:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 03:08:19,087 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:19,087 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:08:19,088 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1477045317, now seen corresponding path program 2 times [2020-04-18 03:08:19,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:19,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911965945] [2020-04-18 03:08:19,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:20,359 WARN L192 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 74 [2020-04-18 03:08:20,667 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2020-04-18 03:08:21,024 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2020-04-18 03:08:21,224 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2020-04-18 03:08:21,376 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2020-04-18 03:08:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:21,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911965945] [2020-04-18 03:08:21,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:21,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-04-18 03:08:21,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189016962] [2020-04-18 03:08:21,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-18 03:08:21,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 03:08:21,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2020-04-18 03:08:21,598 INFO L87 Difference]: Start difference. First operand 2079 states and 4650 transitions. Second operand 19 states. [2020-04-18 03:08:23,747 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 58 [2020-04-18 03:08:24,337 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 95 [2020-04-18 03:08:24,942 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2020-04-18 03:08:25,869 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-04-18 03:08:26,414 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2020-04-18 03:08:26,608 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 Received shutdown request... [2020-04-18 03:08:26,742 WARN L209 SmtUtils]: Removed 28 from assertion stack [2020-04-18 03:08:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-04-18 03:08:26,742 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-18 03:08:26,745 WARN L228 ceAbstractionStarter]: Timeout [2020-04-18 03:08:26,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 03:08:26 BasicIcfg [2020-04-18 03:08:26,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 03:08:26,747 INFO L168 Benchmark]: Toolchain (without parser) took 243622.20 ms. Allocated memory was 145.8 MB in the beginning and 425.2 MB in the end (delta: 279.4 MB). Free memory was 100.9 MB in the beginning and 63.4 MB in the end (delta: 37.5 MB). Peak memory consumption was 316.9 MB. Max. memory is 7.1 GB. [2020-04-18 03:08:26,747 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-04-18 03:08:26,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 992.55 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 99.0 MB in the beginning and 128.6 MB in the end (delta: -29.5 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2020-04-18 03:08:26,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.48 ms. Allocated memory is still 202.4 MB. Free memory was 128.6 MB in the beginning and 124.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-04-18 03:08:26,748 INFO L168 Benchmark]: Boogie Preprocessor took 102.87 ms. Allocated memory is still 202.4 MB. Free memory was 124.5 MB in the beginning and 121.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-04-18 03:08:26,749 INFO L168 Benchmark]: RCFGBuilder took 1211.32 ms. Allocated memory was 202.4 MB in the beginning and 237.0 MB in the end (delta: 34.6 MB). Free memory was 120.4 MB in the beginning and 150.8 MB in the end (delta: -30.4 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. [2020-04-18 03:08:26,750 INFO L168 Benchmark]: TraceAbstraction took 241191.92 ms. Allocated memory was 237.0 MB in the beginning and 425.2 MB in the end (delta: 188.2 MB). Free memory was 149.4 MB in the beginning and 63.4 MB in the end (delta: 86.0 MB). Peak memory consumption was 274.2 MB. Max. memory is 7.1 GB. [2020-04-18 03:08:26,751 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 992.55 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 99.0 MB in the beginning and 128.6 MB in the end (delta: -29.5 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.48 ms. Allocated memory is still 202.4 MB. Free memory was 128.6 MB in the beginning and 124.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.87 ms. Allocated memory is still 202.4 MB. Free memory was 124.5 MB in the beginning and 121.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1211.32 ms. Allocated memory was 202.4 MB in the beginning and 237.0 MB in the end (delta: 34.6 MB). Free memory was 120.4 MB in the beginning and 150.8 MB in the end (delta: -30.4 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241191.92 ms. Allocated memory was 237.0 MB in the beginning and 425.2 MB in the end (delta: 188.2 MB). Free memory was 149.4 MB in the beginning and 63.4 MB in the end (delta: 86.0 MB). Peak memory consumption was 274.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 15.3s, 426 ProgramPointsBefore, 108 ProgramPointsAfterwards, 455 TransitionsBefore, 122 TransitionsAfterwards, 31742 CoEnabledTransitionPairs, 8 FixpointIterations, 119 TrivialSequentialCompositions, 217 ConcurrentSequentialCompositions, 25 TrivialYvCompositions, 63 ConcurrentYvCompositions, 15 ChoiceCompositions, 16803 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 73353 CheckedPairsTotal, 424 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1064). Cancelled while BasicCegarLoop was constructing difference of abstraction (2079states) and FLOYD_HOARE automaton (currently 31 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 74 for 10ms.. - TimeoutResultAtElement [Line: 1087]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1087). Cancelled while BasicCegarLoop was constructing difference of abstraction (2079states) and FLOYD_HOARE automaton (currently 31 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 74 for 10ms.. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (2079states) and FLOYD_HOARE automaton (currently 31 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 74 for 10ms.. - TimeoutResultAtElement [Line: 1085]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1085). Cancelled while BasicCegarLoop was constructing difference of abstraction (2079states) and FLOYD_HOARE automaton (currently 31 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 74 for 10ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2079states) and FLOYD_HOARE automaton (currently 31 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 74 for 10ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2079states) and FLOYD_HOARE automaton (currently 31 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 74 for 10ms.. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (2079states) and FLOYD_HOARE automaton (currently 31 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 74 for 10ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2079states) and FLOYD_HOARE automaton (currently 31 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 74 for 10ms.. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (2079states) and FLOYD_HOARE automaton (currently 31 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 74 for 10ms.. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1065). Cancelled while BasicCegarLoop was constructing difference of abstraction (2079states) and FLOYD_HOARE automaton (currently 31 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 74 for 10ms.. - TimeoutResultAtElement [Line: 1089]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1089). Cancelled while BasicCegarLoop was constructing difference of abstraction (2079states) and FLOYD_HOARE automaton (currently 31 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 74 for 10ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 423 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 240.9s, OverallIterations: 51, TraceHistogramMax: 1, AutomataDifference: 202.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.4s, HoareTripleCheckerStatistics: 5163 SDtfs, 25688 SDslu, 15572 SDs, 0 SdLazy, 98060 SolverSat, 2053 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 105.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1597 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 1537 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8273 ImplicationChecksByTransitivity, 95.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2079occurred in iteration=50, 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, 50 MinimizatonAttempts, 40749 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 783 NumberOfCodeBlocks, 783 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 732 ConstructedInterpolants, 0 QuantifiedInterpolants, 285863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 51 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown