/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:25:54,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:25:54,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:25:54,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:25:54,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:25:54,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:25:54,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:25:54,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:25:54,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:25:54,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:25:54,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:25:54,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:25:54,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:25:54,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:25:54,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:25:54,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:25:54,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:25:54,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:25:54,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:25:54,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:25:54,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:25:54,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:25:54,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:25:54,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:25:54,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:25:54,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:25:54,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:25:54,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:25:54,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:25:54,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:25:54,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:25:54,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:25:54,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:25:54,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:25:54,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:25:54,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:25:54,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:25:54,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:25:54,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:25:54,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:25:54,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:25:54,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:25:54,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:25:54,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:25:54,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:25:54,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:25:54,760 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:25:54,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:25:54,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:25:54,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:25:54,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:25:54,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:25:54,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:25:54,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:25:54,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:25:54,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:25:54,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:25:54,762 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:25:54,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:25:54,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:25:54,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:25:54,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:25:54,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:25:54,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:25:54,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:25:54,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:25:54,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:25:54,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:25:54,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:25:54,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:25:54,765 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:25:54,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:25:55,042 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:25:55,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:25:55,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:25:55,060 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:25:55,060 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:25:55,061 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2019-12-18 15:25:55,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9db0c4dd/bd4394efa990465f82c03da02121d5d4/FLAG1dc1e6330 [2019-12-18 15:25:55,699 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:25:55,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2019-12-18 15:25:55,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9db0c4dd/bd4394efa990465f82c03da02121d5d4/FLAG1dc1e6330 [2019-12-18 15:25:55,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9db0c4dd/bd4394efa990465f82c03da02121d5d4 [2019-12-18 15:25:55,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:25:55,993 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:25:55,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:25:55,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:25:55,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:25:55,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:25:55" (1/1) ... [2019-12-18 15:25:56,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c358ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:55, skipping insertion in model container [2019-12-18 15:25:56,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:25:55" (1/1) ... [2019-12-18 15:25:56,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:25:56,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:25:56,250 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 15:25:56,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:25:56,797 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:25:56,808 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 15:25:56,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:25:57,021 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:25:57,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57 WrapperNode [2019-12-18 15:25:57,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:25:57,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:25:57,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:25:57,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:25:57,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57" (1/1) ... [2019-12-18 15:25:57,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57" (1/1) ... [2019-12-18 15:25:57,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:25:57,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:25:57,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:25:57,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:25:57,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57" (1/1) ... [2019-12-18 15:25:57,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57" (1/1) ... [2019-12-18 15:25:57,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57" (1/1) ... [2019-12-18 15:25:57,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57" (1/1) ... [2019-12-18 15:25:57,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57" (1/1) ... [2019-12-18 15:25:57,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57" (1/1) ... [2019-12-18 15:25:57,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57" (1/1) ... [2019-12-18 15:25:57,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:25:57,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:25:57,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:25:57,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:25:57,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:25:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2019-12-18 15:25:57,285 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2019-12-18 15:25:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:25:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-18 15:25:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:25:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 15:25:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:25:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-18 15:25:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-18 15:25:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:25:57,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:25:57,291 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:25:58,325 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:25:58,325 INFO L287 CfgBuilder]: Removed 40 assume(true) statements. [2019-12-18 15:25:58,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:25:58 BoogieIcfgContainer [2019-12-18 15:25:58,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:25:58,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:25:58,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:25:58,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:25:58,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:25:55" (1/3) ... [2019-12-18 15:25:58,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc38e2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:25:58, skipping insertion in model container [2019-12-18 15:25:58,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57" (2/3) ... [2019-12-18 15:25:58,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc38e2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:25:58, skipping insertion in model container [2019-12-18 15:25:58,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:25:58" (3/3) ... [2019-12-18 15:25:58,347 INFO L109 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.i [2019-12-18 15:25:58,361 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:25:58,362 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:25:58,371 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-12-18 15:25:58,372 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:25:58,448 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,448 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,448 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,449 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,449 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,449 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,450 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,450 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,450 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,451 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,451 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,451 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,451 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,452 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,452 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,452 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,452 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,453 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,453 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,453 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,453 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,454 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,454 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,454 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,454 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,454 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,454 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,455 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,455 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,456 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,456 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,456 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,457 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,457 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,457 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,457 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,458 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,458 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,458 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,458 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,459 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,459 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,459 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,459 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,459 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,460 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,460 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,460 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,460 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,460 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,461 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,461 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,462 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,462 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,462 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,462 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,463 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,463 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,463 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,463 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,464 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,464 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,465 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,465 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,465 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,466 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,466 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,466 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,466 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,467 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,467 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,467 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,467 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,467 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,468 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,468 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,468 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,468 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,469 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,469 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,469 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,469 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,470 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,470 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,470 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,471 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,471 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,471 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,473 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,474 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,474 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,474 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,475 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,475 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,475 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,476 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,476 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,476 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,477 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,477 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,478 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,478 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,482 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,482 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,483 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,483 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,488 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,488 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,488 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,489 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,489 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,489 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,489 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,489 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,490 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,490 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,490 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,490 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,490 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,490 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,491 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,491 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,491 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,491 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,491 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,491 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,492 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,492 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,492 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,492 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,492 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,492 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,493 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,493 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,493 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,493 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,493 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,493 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,494 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,494 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,494 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,494 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,494 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,494 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,495 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,495 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,495 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,495 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,495 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,495 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,496 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,496 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,496 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,496 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,496 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,496 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,497 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,497 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,497 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,497 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,497 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,497 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,497 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,498 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,498 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,498 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,498 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,498 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,498 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,499 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,499 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,499 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,499 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,499 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,499 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,500 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,500 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,500 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,500 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,500 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,500 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,501 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,501 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,501 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,501 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,501 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,501 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,502 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,502 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,502 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,505 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,506 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,506 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,506 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,506 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,506 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,507 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,507 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,507 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,507 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,507 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,507 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,508 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,508 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,508 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,508 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,508 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,508 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,509 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,509 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,509 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,509 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,509 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,510 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,510 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,510 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,510 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,510 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,510 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,511 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,511 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,511 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,511 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,511 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,512 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,512 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,512 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,512 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,512 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,513 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,513 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,513 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,513 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,513 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:25:58,534 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-18 15:25:58,556 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:25:58,556 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:25:58,556 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:25:58,556 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:25:58,556 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:25:58,556 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:25:58,557 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:25:58,557 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:25:58,580 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 443 transitions [2019-12-18 15:25:58,582 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 415 places, 443 transitions [2019-12-18 15:25:58,767 INFO L126 PetriNetUnfolder]: 32/442 cut-off events. [2019-12-18 15:25:58,767 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:25:58,842 INFO L76 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 442 events. 32/442 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1074 event pairs. 6/405 useless extension candidates. Maximal degree in co-relation 316. Up to 3 conditions per place. [2019-12-18 15:25:58,916 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 415 places, 443 transitions [2019-12-18 15:25:59,045 INFO L126 PetriNetUnfolder]: 32/442 cut-off events. [2019-12-18 15:25:59,045 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:25:59,069 INFO L76 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 442 events. 32/442 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1074 event pairs. 6/405 useless extension candidates. Maximal degree in co-relation 316. Up to 3 conditions per place. [2019-12-18 15:25:59,131 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 30326 [2019-12-18 15:25:59,132 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:26:00,643 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:26:00,658 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:26:00,658 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:26:00,659 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2019-12-18 15:26:01,025 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:26:01,039 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:26:01,040 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:26:01,040 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2019-12-18 15:26:03,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:26:03,301 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:26:03,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:26:03,316 INFO L534 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. [2019-12-18 15:26:03,317 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:74 [2019-12-18 15:26:03,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:26:04,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:26:07,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:26:07,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:26:08,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:26:10,511 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 15:26:10,903 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-18 15:26:11,106 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-12-18 15:26:11,393 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 64 [2019-12-18 15:26:13,922 WARN L192 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 156 DAG size of output: 146 [2019-12-18 15:26:13,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:26:13,955 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:26:13,965 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:26:16,101 WARN L192 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 138 [2019-12-18 15:26:16,101 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:26:16,102 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-12-18 15:26:16,103 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:596, output treesize:614 [2019-12-18 15:26:18,287 WARN L192 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 142 [2019-12-18 15:26:20,141 WARN L192 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 164 DAG size of output: 143 [2019-12-18 15:26:20,706 WARN L192 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-12-18 15:26:22,749 WARN L192 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 179 DAG size of output: 173 [2019-12-18 15:26:22,777 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:26:23,460 WARN L192 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-12-18 15:26:23,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:26:23,462 INFO L534 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. [2019-12-18 15:26:23,462 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:452, output treesize:494 [2019-12-18 15:26:24,160 WARN L192 SmtUtils]: Spent 696.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-12-18 15:26:24,736 INFO L206 etLargeBlockEncoding]: Checked pairs total: 106197 [2019-12-18 15:26:24,737 INFO L214 etLargeBlockEncoding]: Total number of compositions: 458 [2019-12-18 15:26:24,740 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 121 transitions [2019-12-18 15:26:24,803 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1414 states. [2019-12-18 15:26:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states. [2019-12-18 15:26:24,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-18 15:26:24,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:24,813 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-18 15:26:24,813 INFO L410 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]=== [2019-12-18 15:26:24,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:24,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1581, now seen corresponding path program 1 times [2019-12-18 15:26:24,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:24,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081422194] [2019-12-18 15:26:24,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:24,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081422194] [2019-12-18 15:26:24,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:24,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-18 15:26:24,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009963570] [2019-12-18 15:26:24,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 15:26:24,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:25,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 15:26:25,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 15:26:25,017 INFO L87 Difference]: Start difference. First operand 1414 states. Second operand 2 states. [2019-12-18 15:26:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:25,084 INFO L93 Difference]: Finished difference Result 1413 states and 3158 transitions. [2019-12-18 15:26:25,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 15:26:25,087 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-18 15:26:25,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:25,124 INFO L225 Difference]: With dead ends: 1413 [2019-12-18 15:26:25,125 INFO L226 Difference]: Without dead ends: 1412 [2019-12-18 15:26:25,126 INFO L631 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 [2019-12-18 15:26:25,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2019-12-18 15:26:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2019-12-18 15:26:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-12-18 15:26:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 3157 transitions. [2019-12-18 15:26:25,273 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 3157 transitions. Word has length 1 [2019-12-18 15:26:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:25,273 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 3157 transitions. [2019-12-18 15:26:25,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 15:26:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 3157 transitions. [2019-12-18 15:26:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-18 15:26:25,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:25,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-18 15:26:25,275 INFO L410 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]=== [2019-12-18 15:26:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash -965036191, now seen corresponding path program 1 times [2019-12-18 15:26:25,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:25,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600374866] [2019-12-18 15:26:25,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:25,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600374866] [2019-12-18 15:26:25,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:25,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:26:25,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70742980] [2019-12-18 15:26:25,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:26:25,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:25,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:26:25,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:26:25,392 INFO L87 Difference]: Start difference. First operand 1412 states and 3157 transitions. Second operand 3 states. [2019-12-18 15:26:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:25,496 INFO L93 Difference]: Finished difference Result 2647 states and 5928 transitions. [2019-12-18 15:26:25,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:26:25,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-18 15:26:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:25,518 INFO L225 Difference]: With dead ends: 2647 [2019-12-18 15:26:25,521 INFO L226 Difference]: Without dead ends: 2647 [2019-12-18 15:26:25,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:26:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-12-18 15:26:25,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1431. [2019-12-18 15:26:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-12-18 15:26:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3197 transitions. [2019-12-18 15:26:25,575 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3197 transitions. Word has length 6 [2019-12-18 15:26:25,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:25,576 INFO L462 AbstractCegarLoop]: Abstraction has 1431 states and 3197 transitions. [2019-12-18 15:26:25,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:26:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3197 transitions. [2019-12-18 15:26:25,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 15:26:25,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:25,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:25,577 INFO L410 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]=== [2019-12-18 15:26:25,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:25,577 INFO L82 PathProgramCache]: Analyzing trace with hash 146313941, now seen corresponding path program 1 times [2019-12-18 15:26:25,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:25,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745134372] [2019-12-18 15:26:25,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:25,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745134372] [2019-12-18 15:26:25,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:25,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:26:25,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126174759] [2019-12-18 15:26:25,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:26:25,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:25,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:26:25,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:26:25,700 INFO L87 Difference]: Start difference. First operand 1431 states and 3197 transitions. Second operand 3 states. [2019-12-18 15:26:25,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:25,715 INFO L93 Difference]: Finished difference Result 1431 states and 3178 transitions. [2019-12-18 15:26:25,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:26:25,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 15:26:25,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:25,724 INFO L225 Difference]: With dead ends: 1431 [2019-12-18 15:26:25,724 INFO L226 Difference]: Without dead ends: 1431 [2019-12-18 15:26:25,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:26:25,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-18 15:26:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2019-12-18 15:26:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-12-18 15:26:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3178 transitions. [2019-12-18 15:26:25,762 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3178 transitions. Word has length 7 [2019-12-18 15:26:25,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:25,762 INFO L462 AbstractCegarLoop]: Abstraction has 1431 states and 3178 transitions. [2019-12-18 15:26:25,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:26:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3178 transitions. [2019-12-18 15:26:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 15:26:25,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:25,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:25,763 INFO L410 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]=== [2019-12-18 15:26:25,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:25,764 INFO L82 PathProgramCache]: Analyzing trace with hash 246365665, now seen corresponding path program 1 times [2019-12-18 15:26:25,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:25,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403951451] [2019-12-18 15:26:25,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:25,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:25,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403951451] [2019-12-18 15:26:25,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:25,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:26:25,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152389571] [2019-12-18 15:26:25,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:26:25,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:25,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:26:25,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:26:25,900 INFO L87 Difference]: Start difference. First operand 1431 states and 3178 transitions. Second operand 6 states. [2019-12-18 15:26:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:26,519 INFO L93 Difference]: Finished difference Result 1817 states and 4039 transitions. [2019-12-18 15:26:26,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:26:26,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-12-18 15:26:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:26,532 INFO L225 Difference]: With dead ends: 1817 [2019-12-18 15:26:26,533 INFO L226 Difference]: Without dead ends: 1817 [2019-12-18 15:26:26,533 INFO L631 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 [2019-12-18 15:26:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2019-12-18 15:26:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1538. [2019-12-18 15:26:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-12-18 15:26:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 3423 transitions. [2019-12-18 15:26:26,586 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 3423 transitions. Word has length 8 [2019-12-18 15:26:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:26,586 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 3423 transitions. [2019-12-18 15:26:26,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:26:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 3423 transitions. [2019-12-18 15:26:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 15:26:26,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:26,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:26,590 INFO L410 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]=== [2019-12-18 15:26:26,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:26,590 INFO L82 PathProgramCache]: Analyzing trace with hash 534612052, now seen corresponding path program 1 times [2019-12-18 15:26:26,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:26,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632187445] [2019-12-18 15:26:26,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:26,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632187445] [2019-12-18 15:26:26,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:26,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:26:26,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726330949] [2019-12-18 15:26:26,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:26:26,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:26,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:26:26,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:26:26,813 INFO L87 Difference]: Start difference. First operand 1538 states and 3423 transitions. Second operand 3 states. [2019-12-18 15:26:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:26,876 INFO L93 Difference]: Finished difference Result 2508 states and 5570 transitions. [2019-12-18 15:26:26,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:26:26,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-18 15:26:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:26,891 INFO L225 Difference]: With dead ends: 2508 [2019-12-18 15:26:26,891 INFO L226 Difference]: Without dead ends: 2508 [2019-12-18 15:26:26,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:26:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-12-18 15:26:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 1595. [2019-12-18 15:26:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-18 15:26:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3543 transitions. [2019-12-18 15:26:26,938 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3543 transitions. Word has length 10 [2019-12-18 15:26:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:26,939 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 3543 transitions. [2019-12-18 15:26:26,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:26:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3543 transitions. [2019-12-18 15:26:26,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:26:26,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:26,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:26,942 INFO L410 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]=== [2019-12-18 15:26:26,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:26,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2116295203, now seen corresponding path program 1 times [2019-12-18 15:26:26,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:26,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259497948] [2019-12-18 15:26:26,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:27,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259497948] [2019-12-18 15:26:27,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:27,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:26:27,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95222747] [2019-12-18 15:26:27,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:26:27,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:27,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:26:27,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:26:27,100 INFO L87 Difference]: Start difference. First operand 1595 states and 3543 transitions. Second operand 8 states. [2019-12-18 15:26:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:28,208 INFO L93 Difference]: Finished difference Result 1987 states and 4399 transitions. [2019-12-18 15:26:28,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:26:28,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-18 15:26:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:28,227 INFO L225 Difference]: With dead ends: 1987 [2019-12-18 15:26:28,228 INFO L226 Difference]: Without dead ends: 1987 [2019-12-18 15:26:28,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:26:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2019-12-18 15:26:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1609. [2019-12-18 15:26:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-12-18 15:26:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3575 transitions. [2019-12-18 15:26:28,276 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3575 transitions. Word has length 14 [2019-12-18 15:26:28,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:28,277 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3575 transitions. [2019-12-18 15:26:28,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:26:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3575 transitions. [2019-12-18 15:26:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:26:28,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:28,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:28,280 INFO L410 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]=== [2019-12-18 15:26:28,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:28,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1320004501, now seen corresponding path program 2 times [2019-12-18 15:26:28,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:28,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986237963] [2019-12-18 15:26:28,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:28,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:28,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986237963] [2019-12-18 15:26:28,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:28,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:26:28,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58642461] [2019-12-18 15:26:28,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:26:28,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:28,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:26:28,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:26:28,436 INFO L87 Difference]: Start difference. First operand 1609 states and 3575 transitions. Second operand 11 states. [2019-12-18 15:26:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:30,338 INFO L93 Difference]: Finished difference Result 2023 states and 4477 transitions. [2019-12-18 15:26:30,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 15:26:30,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-18 15:26:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:30,352 INFO L225 Difference]: With dead ends: 2023 [2019-12-18 15:26:30,352 INFO L226 Difference]: Without dead ends: 2023 [2019-12-18 15:26:30,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:26:30,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2019-12-18 15:26:30,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1611. [2019-12-18 15:26:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2019-12-18 15:26:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 3579 transitions. [2019-12-18 15:26:30,394 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 3579 transitions. Word has length 14 [2019-12-18 15:26:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:30,394 INFO L462 AbstractCegarLoop]: Abstraction has 1611 states and 3579 transitions. [2019-12-18 15:26:30,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:26:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 3579 transitions. [2019-12-18 15:26:30,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:26:30,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:30,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:30,396 INFO L410 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]=== [2019-12-18 15:26:30,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:30,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1957828637, now seen corresponding path program 3 times [2019-12-18 15:26:30,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:30,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750320083] [2019-12-18 15:26:30,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:30,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750320083] [2019-12-18 15:26:30,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:30,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:26:30,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382554820] [2019-12-18 15:26:30,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:26:30,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:30,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:26:30,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:26:30,543 INFO L87 Difference]: Start difference. First operand 1611 states and 3579 transitions. Second operand 11 states. [2019-12-18 15:26:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:32,974 INFO L93 Difference]: Finished difference Result 2052 states and 4538 transitions. [2019-12-18 15:26:32,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:26:32,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-18 15:26:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:32,987 INFO L225 Difference]: With dead ends: 2052 [2019-12-18 15:26:32,987 INFO L226 Difference]: Without dead ends: 2052 [2019-12-18 15:26:32,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2019-12-18 15:26:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2019-12-18 15:26:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1604. [2019-12-18 15:26:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-12-18 15:26:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3563 transitions. [2019-12-18 15:26:33,028 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3563 transitions. Word has length 14 [2019-12-18 15:26:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:33,028 INFO L462 AbstractCegarLoop]: Abstraction has 1604 states and 3563 transitions. [2019-12-18 15:26:33,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:26:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3563 transitions. [2019-12-18 15:26:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:26:33,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:33,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:33,030 INFO L410 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]=== [2019-12-18 15:26:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:33,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1287222187, now seen corresponding path program 1 times [2019-12-18 15:26:33,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:33,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441790176] [2019-12-18 15:26:33,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:33,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441790176] [2019-12-18 15:26:33,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:33,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:26:33,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865983031] [2019-12-18 15:26:33,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:26:33,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:33,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:26:33,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:26:33,175 INFO L87 Difference]: Start difference. First operand 1604 states and 3563 transitions. Second operand 8 states. [2019-12-18 15:26:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:34,332 INFO L93 Difference]: Finished difference Result 2382 states and 5288 transitions. [2019-12-18 15:26:34,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:26:34,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-18 15:26:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:34,359 INFO L225 Difference]: With dead ends: 2382 [2019-12-18 15:26:34,359 INFO L226 Difference]: Without dead ends: 2345 [2019-12-18 15:26:34,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:26:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2019-12-18 15:26:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1762. [2019-12-18 15:26:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2019-12-18 15:26:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 3963 transitions. [2019-12-18 15:26:34,421 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 3963 transitions. Word has length 14 [2019-12-18 15:26:34,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:34,421 INFO L462 AbstractCegarLoop]: Abstraction has 1762 states and 3963 transitions. [2019-12-18 15:26:34,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:26:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 3963 transitions. [2019-12-18 15:26:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:26:34,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:34,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:34,423 INFO L410 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]=== [2019-12-18 15:26:34,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:34,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2126637629, now seen corresponding path program 1 times [2019-12-18 15:26:34,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:34,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322169660] [2019-12-18 15:26:34,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:34,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322169660] [2019-12-18 15:26:34,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:34,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:26:34,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754131553] [2019-12-18 15:26:34,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:26:34,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:34,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:26:34,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:26:34,625 INFO L87 Difference]: Start difference. First operand 1762 states and 3963 transitions. Second operand 7 states. [2019-12-18 15:26:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:35,582 INFO L93 Difference]: Finished difference Result 2376 states and 5313 transitions. [2019-12-18 15:26:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:26:35,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 15:26:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:35,592 INFO L225 Difference]: With dead ends: 2376 [2019-12-18 15:26:35,592 INFO L226 Difference]: Without dead ends: 2376 [2019-12-18 15:26:35,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:26:35,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-18 15:26:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1843. [2019-12-18 15:26:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1843 states. [2019-12-18 15:26:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 4143 transitions. [2019-12-18 15:26:35,681 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 4143 transitions. Word has length 15 [2019-12-18 15:26:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:35,682 INFO L462 AbstractCegarLoop]: Abstraction has 1843 states and 4143 transitions. [2019-12-18 15:26:35,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:26:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 4143 transitions. [2019-12-18 15:26:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:26:35,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:35,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:35,684 INFO L410 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]=== [2019-12-18 15:26:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash -287376241, now seen corresponding path program 2 times [2019-12-18 15:26:35,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:35,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638076965] [2019-12-18 15:26:35,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:36,225 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-12-18 15:26:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:36,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638076965] [2019-12-18 15:26:36,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:36,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:26:36,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354228186] [2019-12-18 15:26:36,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:26:36,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:36,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:26:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:26:36,314 INFO L87 Difference]: Start difference. First operand 1843 states and 4143 transitions. Second operand 13 states. [2019-12-18 15:26:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:39,499 INFO L93 Difference]: Finished difference Result 2686 states and 5978 transitions. [2019-12-18 15:26:39,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 15:26:39,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-18 15:26:39,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:39,507 INFO L225 Difference]: With dead ends: 2686 [2019-12-18 15:26:39,507 INFO L226 Difference]: Without dead ends: 2686 [2019-12-18 15:26:39,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:26:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2019-12-18 15:26:39,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 1867. [2019-12-18 15:26:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-12-18 15:26:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 4199 transitions. [2019-12-18 15:26:39,552 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 4199 transitions. Word has length 15 [2019-12-18 15:26:39,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:39,552 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 4199 transitions. [2019-12-18 15:26:39,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:26:39,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 4199 transitions. [2019-12-18 15:26:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:26:39,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:39,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:39,554 INFO L410 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]=== [2019-12-18 15:26:39,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:39,554 INFO L82 PathProgramCache]: Analyzing trace with hash 456627383, now seen corresponding path program 1 times [2019-12-18 15:26:39,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:39,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755814283] [2019-12-18 15:26:39,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:39,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755814283] [2019-12-18 15:26:39,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:39,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:26:39,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206855362] [2019-12-18 15:26:39,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:26:39,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:39,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:26:39,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:26:39,686 INFO L87 Difference]: Start difference. First operand 1867 states and 4199 transitions. Second operand 10 states. [2019-12-18 15:26:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:41,060 INFO L93 Difference]: Finished difference Result 2432 states and 5429 transitions. [2019-12-18 15:26:41,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:26:41,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-18 15:26:41,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:41,074 INFO L225 Difference]: With dead ends: 2432 [2019-12-18 15:26:41,074 INFO L226 Difference]: Without dead ends: 2432 [2019-12-18 15:26:41,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:26:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2019-12-18 15:26:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 1929. [2019-12-18 15:26:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2019-12-18 15:26:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 4344 transitions. [2019-12-18 15:26:41,127 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 4344 transitions. Word has length 15 [2019-12-18 15:26:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:41,127 INFO L462 AbstractCegarLoop]: Abstraction has 1929 states and 4344 transitions. [2019-12-18 15:26:41,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:26:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 4344 transitions. [2019-12-18 15:26:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:26:41,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:41,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:41,129 INFO L410 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]=== [2019-12-18 15:26:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:41,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1240586563, now seen corresponding path program 3 times [2019-12-18 15:26:41,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:41,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098091558] [2019-12-18 15:26:41,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:41,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098091558] [2019-12-18 15:26:41,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:41,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:26:41,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853847743] [2019-12-18 15:26:41,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:26:41,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:41,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:26:41,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:26:41,485 INFO L87 Difference]: Start difference. First operand 1929 states and 4344 transitions. Second operand 13 states. [2019-12-18 15:26:42,384 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-12-18 15:26:43,396 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-12-18 15:26:43,626 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-12-18 15:26:44,041 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-12-18 15:26:44,587 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-12-18 15:26:44,983 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 60 [2019-12-18 15:26:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:46,227 INFO L93 Difference]: Finished difference Result 2888 states and 6449 transitions. [2019-12-18 15:26:46,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 15:26:46,227 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-18 15:26:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:46,236 INFO L225 Difference]: With dead ends: 2888 [2019-12-18 15:26:46,236 INFO L226 Difference]: Without dead ends: 2888 [2019-12-18 15:26:46,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=400, Invalid=932, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 15:26:46,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2019-12-18 15:26:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1968. [2019-12-18 15:26:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1968 states. [2019-12-18 15:26:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 4437 transitions. [2019-12-18 15:26:46,283 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 4437 transitions. Word has length 15 [2019-12-18 15:26:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:46,284 INFO L462 AbstractCegarLoop]: Abstraction has 1968 states and 4437 transitions. [2019-12-18 15:26:46,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:26:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 4437 transitions. [2019-12-18 15:26:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:26:46,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:46,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:46,286 INFO L410 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]=== [2019-12-18 15:26:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:46,287 INFO L82 PathProgramCache]: Analyzing trace with hash 287771511, now seen corresponding path program 2 times [2019-12-18 15:26:46,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:46,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145551573] [2019-12-18 15:26:46,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:46,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145551573] [2019-12-18 15:26:46,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:46,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:26:46,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210718199] [2019-12-18 15:26:46,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:26:46,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:46,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:26:46,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:26:46,487 INFO L87 Difference]: Start difference. First operand 1968 states and 4437 transitions. Second operand 14 states. [2019-12-18 15:26:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:50,814 INFO L93 Difference]: Finished difference Result 3807 states and 8456 transitions. [2019-12-18 15:26:50,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 15:26:50,815 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-12-18 15:26:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:50,823 INFO L225 Difference]: With dead ends: 3807 [2019-12-18 15:26:50,823 INFO L226 Difference]: Without dead ends: 3807 [2019-12-18 15:26:50,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=491, Invalid=1149, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:26:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2019-12-18 15:26:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 1947. [2019-12-18 15:26:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2019-12-18 15:26:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 4387 transitions. [2019-12-18 15:26:50,876 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 4387 transitions. Word has length 15 [2019-12-18 15:26:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:50,876 INFO L462 AbstractCegarLoop]: Abstraction has 1947 states and 4387 transitions. [2019-12-18 15:26:50,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:26:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 4387 transitions. [2019-12-18 15:26:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:26:50,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:50,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:50,878 INFO L410 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]=== [2019-12-18 15:26:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash 511503391, now seen corresponding path program 4 times [2019-12-18 15:26:50,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:50,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366236023] [2019-12-18 15:26:50,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:51,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366236023] [2019-12-18 15:26:51,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:51,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:26:51,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360342046] [2019-12-18 15:26:51,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:26:51,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:51,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:26:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:26:51,271 INFO L87 Difference]: Start difference. First operand 1947 states and 4387 transitions. Second operand 13 states. [2019-12-18 15:26:53,107 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-12-18 15:26:53,587 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2019-12-18 15:26:53,729 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-12-18 15:26:54,159 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-12-18 15:26:54,690 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2019-12-18 15:26:55,284 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-12-18 15:26:55,712 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 60 [2019-12-18 15:26:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:26:57,155 INFO L93 Difference]: Finished difference Result 2712 states and 6057 transitions. [2019-12-18 15:26:57,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 15:26:57,155 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-18 15:26:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:26:57,164 INFO L225 Difference]: With dead ends: 2712 [2019-12-18 15:26:57,164 INFO L226 Difference]: Without dead ends: 2712 [2019-12-18 15:26:57,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=501, Invalid=1221, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 15:26:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2019-12-18 15:26:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 1926. [2019-12-18 15:26:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-12-18 15:26:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 4335 transitions. [2019-12-18 15:26:57,228 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 4335 transitions. Word has length 15 [2019-12-18 15:26:57,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:26:57,229 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 4335 transitions. [2019-12-18 15:26:57,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:26:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 4335 transitions. [2019-12-18 15:26:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:26:57,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:26:57,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:26:57,231 INFO L410 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]=== [2019-12-18 15:26:57,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:26:57,231 INFO L82 PathProgramCache]: Analyzing trace with hash -738259267, now seen corresponding path program 5 times [2019-12-18 15:26:57,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:26:57,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401402227] [2019-12-18 15:26:57,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:26:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:26:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:26:57,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401402227] [2019-12-18 15:26:57,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:26:57,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:26:57,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288041724] [2019-12-18 15:26:57,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:26:57,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:26:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:26:57,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:26:57,563 INFO L87 Difference]: Start difference. First operand 1926 states and 4335 transitions. Second operand 13 states. [2019-12-18 15:27:00,186 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2019-12-18 15:27:01,637 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2019-12-18 15:27:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:27:03,137 INFO L93 Difference]: Finished difference Result 2468 states and 5513 transitions. [2019-12-18 15:27:03,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:27:03,138 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-18 15:27:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:27:03,142 INFO L225 Difference]: With dead ends: 2468 [2019-12-18 15:27:03,142 INFO L226 Difference]: Without dead ends: 2468 [2019-12-18 15:27:03,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=431, Invalid=1129, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 15:27:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2019-12-18 15:27:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 1919. [2019-12-18 15:27:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1919 states. [2019-12-18 15:27:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 4320 transitions. [2019-12-18 15:27:03,178 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 4320 transitions. Word has length 15 [2019-12-18 15:27:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:27:03,179 INFO L462 AbstractCegarLoop]: Abstraction has 1919 states and 4320 transitions. [2019-12-18 15:27:03,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:27:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 4320 transitions. [2019-12-18 15:27:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:27:03,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:27:03,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:27:03,181 INFO L410 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]=== [2019-12-18 15:27:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:27:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1923654897, now seen corresponding path program 6 times [2019-12-18 15:27:03,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:27:03,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895210968] [2019-12-18 15:27:03,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:27:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:27:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:27:03,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895210968] [2019-12-18 15:27:03,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:27:03,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:27:03,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206164608] [2019-12-18 15:27:03,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:27:03,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:27:03,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:27:03,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:27:03,462 INFO L87 Difference]: Start difference. First operand 1919 states and 4320 transitions. Second operand 13 states. [2019-12-18 15:27:04,927 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-12-18 15:27:05,540 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-12-18 15:27:05,777 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2019-12-18 15:27:06,487 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2019-12-18 15:27:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:27:08,276 INFO L93 Difference]: Finished difference Result 2464 states and 5507 transitions. [2019-12-18 15:27:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:27:08,277 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-18 15:27:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:27:08,281 INFO L225 Difference]: With dead ends: 2464 [2019-12-18 15:27:08,281 INFO L226 Difference]: Without dead ends: 2464 [2019-12-18 15:27:08,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=457, Invalid=1183, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:27:08,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-12-18 15:27:08,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1923. [2019-12-18 15:27:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2019-12-18 15:27:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 4328 transitions. [2019-12-18 15:27:08,316 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 4328 transitions. Word has length 15 [2019-12-18 15:27:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:27:08,316 INFO L462 AbstractCegarLoop]: Abstraction has 1923 states and 4328 transitions. [2019-12-18 15:27:08,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:27:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 4328 transitions. [2019-12-18 15:27:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:27:08,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:27:08,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:27:08,319 INFO L410 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]=== [2019-12-18 15:27:08,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:27:08,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1843716137, now seen corresponding path program 7 times [2019-12-18 15:27:08,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:27:08,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41949733] [2019-12-18 15:27:08,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:27:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:27:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:27:08,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41949733] [2019-12-18 15:27:08,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:27:08,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:27:08,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894920864] [2019-12-18 15:27:08,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:27:08,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:27:08,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:27:08,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:27:08,649 INFO L87 Difference]: Start difference. First operand 1923 states and 4328 transitions. Second operand 13 states. [2019-12-18 15:27:10,795 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-12-18 15:27:10,976 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 63 [2019-12-18 15:27:11,201 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2019-12-18 15:27:11,444 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 65 [2019-12-18 15:27:12,131 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2019-12-18 15:27:12,938 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-12-18 15:27:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:27:14,428 INFO L93 Difference]: Finished difference Result 2426 states and 5423 transitions. [2019-12-18 15:27:14,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 15:27:14,429 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-18 15:27:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:27:14,433 INFO L225 Difference]: With dead ends: 2426 [2019-12-18 15:27:14,433 INFO L226 Difference]: Without dead ends: 2426 [2019-12-18 15:27:14,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=443, Invalid=1197, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:27:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2019-12-18 15:27:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 1914. [2019-12-18 15:27:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-18 15:27:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 4307 transitions. [2019-12-18 15:27:14,466 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 4307 transitions. Word has length 15 [2019-12-18 15:27:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:27:14,466 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 4307 transitions. [2019-12-18 15:27:14,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:27:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 4307 transitions. [2019-12-18 15:27:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:27:14,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:27:14,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:27:14,468 INFO L410 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]=== [2019-12-18 15:27:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:27:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2029270197, now seen corresponding path program 3 times [2019-12-18 15:27:14,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:27:14,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296239063] [2019-12-18 15:27:14,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:27:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:27:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:27:14,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296239063] [2019-12-18 15:27:14,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:27:14,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:27:14,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446911732] [2019-12-18 15:27:14,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:27:14,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:27:14,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:27:14,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:27:14,667 INFO L87 Difference]: Start difference. First operand 1914 states and 4307 transitions. Second operand 13 states. [2019-12-18 15:27:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:27:17,395 INFO L93 Difference]: Finished difference Result 2606 states and 5812 transitions. [2019-12-18 15:27:17,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 15:27:17,396 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-18 15:27:17,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:27:17,400 INFO L225 Difference]: With dead ends: 2606 [2019-12-18 15:27:17,400 INFO L226 Difference]: Without dead ends: 2606 [2019-12-18 15:27:17,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:27:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2019-12-18 15:27:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 1920. [2019-12-18 15:27:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2019-12-18 15:27:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 4319 transitions. [2019-12-18 15:27:17,434 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 4319 transitions. Word has length 15 [2019-12-18 15:27:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:27:17,434 INFO L462 AbstractCegarLoop]: Abstraction has 1920 states and 4319 transitions. [2019-12-18 15:27:17,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:27:17,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 4319 transitions. [2019-12-18 15:27:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:27:17,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:27:17,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:27:17,437 INFO L410 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]=== [2019-12-18 15:27:17,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:27:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash -563408835, now seen corresponding path program 4 times [2019-12-18 15:27:17,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:27:17,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528772741] [2019-12-18 15:27:17,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:27:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:27:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:27:17,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528772741] [2019-12-18 15:27:17,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:27:17,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:27:17,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805947859] [2019-12-18 15:27:17,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:27:17,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:27:17,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:27:17,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:27:17,595 INFO L87 Difference]: Start difference. First operand 1920 states and 4319 transitions. Second operand 13 states. [2019-12-18 15:27:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:27:21,181 INFO L93 Difference]: Finished difference Result 2632 states and 5860 transitions. [2019-12-18 15:27:21,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 15:27:21,182 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-18 15:27:21,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:27:21,186 INFO L225 Difference]: With dead ends: 2632 [2019-12-18 15:27:21,186 INFO L226 Difference]: Without dead ends: 2632 [2019-12-18 15:27:21,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=333, Invalid=857, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 15:27:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2019-12-18 15:27:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 1902. [2019-12-18 15:27:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-12-18 15:27:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 4278 transitions. [2019-12-18 15:27:21,217 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 4278 transitions. Word has length 15 [2019-12-18 15:27:21,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:27:21,217 INFO L462 AbstractCegarLoop]: Abstraction has 1902 states and 4278 transitions. [2019-12-18 15:27:21,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:27:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 4278 transitions. [2019-12-18 15:27:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:27:21,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:27:21,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:27:21,219 INFO L410 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]=== [2019-12-18 15:27:21,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:27:21,219 INFO L82 PathProgramCache]: Analyzing trace with hash -646786075, now seen corresponding path program 8 times [2019-12-18 15:27:21,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:27:21,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155695553] [2019-12-18 15:27:21,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:27:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:27:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:27:21,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155695553] [2019-12-18 15:27:21,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:27:21,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:27:21,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063829333] [2019-12-18 15:27:21,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:27:21,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:27:21,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:27:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:27:21,372 INFO L87 Difference]: Start difference. First operand 1902 states and 4278 transitions. Second operand 7 states. [2019-12-18 15:27:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:27:22,295 INFO L93 Difference]: Finished difference Result 2242 states and 4995 transitions. [2019-12-18 15:27:22,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:27:22,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 15:27:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:27:22,299 INFO L225 Difference]: With dead ends: 2242 [2019-12-18 15:27:22,299 INFO L226 Difference]: Without dead ends: 2242 [2019-12-18 15:27:22,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:27:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-12-18 15:27:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 1853. [2019-12-18 15:27:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-12-18 15:27:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 4163 transitions. [2019-12-18 15:27:22,328 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 4163 transitions. Word has length 15 [2019-12-18 15:27:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:27:22,328 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 4163 transitions. [2019-12-18 15:27:22,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:27:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 4163 transitions. [2019-12-18 15:27:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:27:22,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:27:22,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:27:22,330 INFO L410 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]=== [2019-12-18 15:27:22,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:27:22,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1234167351, now seen corresponding path program 9 times [2019-12-18 15:27:22,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:27:22,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937871927] [2019-12-18 15:27:22,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:27:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:27:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:27:23,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937871927] [2019-12-18 15:27:23,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:27:23,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:27:23,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130525545] [2019-12-18 15:27:23,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:27:23,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:27:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:27:23,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:27:23,019 INFO L87 Difference]: Start difference. First operand 1853 states and 4163 transitions. Second operand 13 states. [2019-12-18 15:27:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:27:25,668 INFO L93 Difference]: Finished difference Result 2487 states and 5531 transitions. [2019-12-18 15:27:25,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:27:25,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-18 15:27:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:27:25,672 INFO L225 Difference]: With dead ends: 2487 [2019-12-18 15:27:25,672 INFO L226 Difference]: Without dead ends: 2487 [2019-12-18 15:27:25,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:27:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2019-12-18 15:27:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 1855. [2019-12-18 15:27:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1855 states. [2019-12-18 15:27:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 4169 transitions. [2019-12-18 15:27:25,695 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 4169 transitions. Word has length 15 [2019-12-18 15:27:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:27:25,695 INFO L462 AbstractCegarLoop]: Abstraction has 1855 states and 4169 transitions. [2019-12-18 15:27:25,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:27:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 4169 transitions. [2019-12-18 15:27:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:27:25,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:27:25,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:27:25,697 INFO L410 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]=== [2019-12-18 15:27:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:27:25,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1347024091, now seen corresponding path program 10 times [2019-12-18 15:27:25,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:27:25,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287062291] [2019-12-18 15:27:25,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:27:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:27:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:27:25,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287062291] [2019-12-18 15:27:25,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:27:25,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:27:25,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053204459] [2019-12-18 15:27:25,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:27:25,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:27:25,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:27:25,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:27:25,993 INFO L87 Difference]: Start difference. First operand 1855 states and 4169 transitions. Second operand 13 states. [2019-12-18 15:27:27,239 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2019-12-18 15:27:27,487 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 54 [2019-12-18 15:27:27,769 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-12-18 15:27:28,560 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-12-18 15:27:28,928 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 60 [2019-12-18 15:27:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:27:30,195 INFO L93 Difference]: Finished difference Result 2551 states and 5673 transitions. [2019-12-18 15:27:30,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 15:27:30,196 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-18 15:27:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:27:30,199 INFO L225 Difference]: With dead ends: 2551 [2019-12-18 15:27:30,200 INFO L226 Difference]: Without dead ends: 2551 [2019-12-18 15:27:30,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=316, Invalid=740, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 15:27:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2019-12-18 15:27:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 1811. [2019-12-18 15:27:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2019-12-18 15:27:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 4059 transitions. [2019-12-18 15:27:30,232 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 4059 transitions. Word has length 15 [2019-12-18 15:27:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:27:30,232 INFO L462 AbstractCegarLoop]: Abstraction has 1811 states and 4059 transitions. [2019-12-18 15:27:30,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:27:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 4059 transitions. [2019-12-18 15:27:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:27:30,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:27:30,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:27:30,234 INFO L410 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]=== [2019-12-18 15:27:30,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:27:30,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1298791937, now seen corresponding path program 1 times [2019-12-18 15:27:30,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:27:30,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818203802] [2019-12-18 15:27:30,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:27:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:27:30,620 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2019-12-18 15:27:30,750 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-12-18 15:27:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:27:31,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818203802] [2019-12-18 15:27:31,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:27:31,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:27:31,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982487538] [2019-12-18 15:27:31,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:27:31,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:27:31,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:27:31,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:27:31,076 INFO L87 Difference]: Start difference. First operand 1811 states and 4059 transitions. Second operand 16 states. [2019-12-18 15:27:31,804 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-12-18 15:27:32,202 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-12-18 15:27:32,336 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-12-18 15:27:32,639 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 68 [2019-12-18 15:27:33,928 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-12-18 15:27:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:27:36,611 INFO L93 Difference]: Finished difference Result 3173 states and 7098 transitions. [2019-12-18 15:27:36,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 15:27:36,612 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-18 15:27:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:27:36,617 INFO L225 Difference]: With dead ends: 3173 [2019-12-18 15:27:36,617 INFO L226 Difference]: Without dead ends: 3173 [2019-12-18 15:27:36,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:27:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2019-12-18 15:27:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 1999. [2019-12-18 15:27:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-12-18 15:27:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 4525 transitions. [2019-12-18 15:27:36,649 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 4525 transitions. Word has length 17 [2019-12-18 15:27:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:27:36,649 INFO L462 AbstractCegarLoop]: Abstraction has 1999 states and 4525 transitions. [2019-12-18 15:27:36,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:27:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 4525 transitions. [2019-12-18 15:27:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:27:36,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:27:36,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:27:36,651 INFO L410 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]=== [2019-12-18 15:27:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:27:36,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1714405217, now seen corresponding path program 2 times [2019-12-18 15:27:36,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:27:36,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111612994] [2019-12-18 15:27:36,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:27:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:27:37,236 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2019-12-18 15:27:37,400 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-12-18 15:27:37,576 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-12-18 15:27:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:27:37,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111612994] [2019-12-18 15:27:37,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:27:37,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:27:37,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352335164] [2019-12-18 15:27:37,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:27:37,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:27:37,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:27:37,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:27:37,660 INFO L87 Difference]: Start difference. First operand 1999 states and 4525 transitions. Second operand 12 states. [2019-12-18 15:27:38,589 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-12-18 15:27:38,775 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-12-18 15:27:41,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:27:41,870 INFO L93 Difference]: Finished difference Result 4057 states and 9220 transitions. [2019-12-18 15:27:41,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 15:27:41,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-12-18 15:27:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:27:41,876 INFO L225 Difference]: With dead ends: 4057 [2019-12-18 15:27:41,876 INFO L226 Difference]: Without dead ends: 4057 [2019-12-18 15:27:41,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:27:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4057 states. [2019-12-18 15:27:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4057 to 2029. [2019-12-18 15:27:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2019-12-18 15:27:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 4607 transitions. [2019-12-18 15:27:41,906 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 4607 transitions. Word has length 17 [2019-12-18 15:27:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:27:41,906 INFO L462 AbstractCegarLoop]: Abstraction has 2029 states and 4607 transitions. [2019-12-18 15:27:41,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:27:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 4607 transitions. [2019-12-18 15:27:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:27:41,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:27:41,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:27:41,908 INFO L410 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]=== [2019-12-18 15:27:41,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:27:41,908 INFO L82 PathProgramCache]: Analyzing trace with hash 163929587, now seen corresponding path program 3 times [2019-12-18 15:27:41,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:27:41,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461728695] [2019-12-18 15:27:41,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:27:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:27:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:27:42,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461728695] [2019-12-18 15:27:42,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:27:42,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:27:42,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229364430] [2019-12-18 15:27:42,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:27:42,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:27:42,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:27:42,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:27:42,827 INFO L87 Difference]: Start difference. First operand 2029 states and 4607 transitions. Second operand 16 states. [2019-12-18 15:27:43,590 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-18 15:27:44,049 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2019-12-18 15:27:44,505 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2019-12-18 15:27:45,786 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2019-12-18 15:27:46,100 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-12-18 15:27:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:27:48,740 INFO L93 Difference]: Finished difference Result 3628 states and 8223 transitions. [2019-12-18 15:27:48,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 15:27:48,740 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-18 15:27:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:27:48,746 INFO L225 Difference]: With dead ends: 3628 [2019-12-18 15:27:48,746 INFO L226 Difference]: Without dead ends: 3628 [2019-12-18 15:27:48,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=266, Invalid=924, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 15:27:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2019-12-18 15:27:48,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 2052. [2019-12-18 15:27:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-12-18 15:27:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 4663 transitions. [2019-12-18 15:27:48,782 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 4663 transitions. Word has length 17 [2019-12-18 15:27:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:27:48,783 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 4663 transitions. [2019-12-18 15:27:48,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:27:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 4663 transitions. [2019-12-18 15:27:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:27:48,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:27:48,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:27:48,785 INFO L410 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]=== [2019-12-18 15:27:48,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:27:48,785 INFO L82 PathProgramCache]: Analyzing trace with hash -175437185, now seen corresponding path program 4 times [2019-12-18 15:27:48,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:27:48,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313059666] [2019-12-18 15:27:48,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:27:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:27:49,435 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-12-18 15:27:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:27:49,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313059666] [2019-12-18 15:27:49,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:27:49,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:27:49,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791364187] [2019-12-18 15:27:49,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:27:49,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:27:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:27:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:27:49,616 INFO L87 Difference]: Start difference. First operand 2052 states and 4663 transitions. Second operand 16 states. [2019-12-18 15:27:50,906 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2019-12-18 15:27:51,330 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 72 [2019-12-18 15:27:51,488 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 45 [2019-12-18 15:27:52,022 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-12-18 15:27:52,916 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 41 [2019-12-18 15:27:53,443 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 48 [2019-12-18 15:27:56,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:27:56,348 INFO L93 Difference]: Finished difference Result 3694 states and 8359 transitions. [2019-12-18 15:27:56,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 15:27:56,348 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-18 15:27:56,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:27:56,354 INFO L225 Difference]: With dead ends: 3694 [2019-12-18 15:27:56,354 INFO L226 Difference]: Without dead ends: 3694 [2019-12-18 15:27:56,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 15:27:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2019-12-18 15:27:56,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 2058. [2019-12-18 15:27:56,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-12-18 15:27:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 4676 transitions. [2019-12-18 15:27:56,384 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 4676 transitions. Word has length 17 [2019-12-18 15:27:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:27:56,384 INFO L462 AbstractCegarLoop]: Abstraction has 2058 states and 4676 transitions. [2019-12-18 15:27:56,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:27:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 4676 transitions. [2019-12-18 15:27:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:27:56,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:27:56,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:27:56,386 INFO L410 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]=== [2019-12-18 15:27:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:27:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1789089965, now seen corresponding path program 5 times [2019-12-18 15:27:56,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:27:56,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645574291] [2019-12-18 15:27:56,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:27:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:27:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:27:56,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645574291] [2019-12-18 15:27:56,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:27:56,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:27:56,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431836137] [2019-12-18 15:27:56,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:27:56,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:27:56,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:27:56,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:27:56,988 INFO L87 Difference]: Start difference. First operand 2058 states and 4676 transitions. Second operand 15 states. [2019-12-18 15:27:57,643 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2019-12-18 15:27:57,941 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-12-18 15:27:58,476 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 52 [2019-12-18 15:27:59,008 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-12-18 15:27:59,667 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2019-12-18 15:28:00,091 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2019-12-18 15:28:00,405 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 55 [2019-12-18 15:28:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:28:02,513 INFO L93 Difference]: Finished difference Result 3866 states and 8767 transitions. [2019-12-18 15:28:02,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 15:28:02,514 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-18 15:28:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:28:02,519 INFO L225 Difference]: With dead ends: 3866 [2019-12-18 15:28:02,520 INFO L226 Difference]: Without dead ends: 3866 [2019-12-18 15:28:02,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=330, Invalid=930, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:28:02,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3866 states. [2019-12-18 15:28:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3866 to 2034. [2019-12-18 15:28:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-12-18 15:28:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 4621 transitions. [2019-12-18 15:28:02,567 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 4621 transitions. Word has length 17 [2019-12-18 15:28:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:28:02,567 INFO L462 AbstractCegarLoop]: Abstraction has 2034 states and 4621 transitions. [2019-12-18 15:28:02,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:28:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 4621 transitions. [2019-12-18 15:28:02,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:28:02,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:28:02,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:28:02,574 INFO L410 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]=== [2019-12-18 15:28:02,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:28:02,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1670599107, now seen corresponding path program 6 times [2019-12-18 15:28:02,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:28:02,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508841340] [2019-12-18 15:28:02,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:28:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:28:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:28:03,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508841340] [2019-12-18 15:28:03,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:28:03,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:28:03,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021594633] [2019-12-18 15:28:03,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:28:03,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:28:03,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:28:03,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:28:03,330 INFO L87 Difference]: Start difference. First operand 2034 states and 4621 transitions. Second operand 16 states. [2019-12-18 15:28:04,177 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-12-18 15:28:04,892 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 53 [2019-12-18 15:28:05,040 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-12-18 15:28:05,367 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 68 [2019-12-18 15:28:06,739 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 59 [2019-12-18 15:28:07,235 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-12-18 15:28:07,583 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-12-18 15:28:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:28:09,951 INFO L93 Difference]: Finished difference Result 3425 states and 7777 transitions. [2019-12-18 15:28:09,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 15:28:09,951 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-18 15:28:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:28:09,956 INFO L225 Difference]: With dead ends: 3425 [2019-12-18 15:28:09,956 INFO L226 Difference]: Without dead ends: 3425 [2019-12-18 15:28:09,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=422, Invalid=1384, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 15:28:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2019-12-18 15:28:09,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 2072. [2019-12-18 15:28:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2019-12-18 15:28:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 4712 transitions. [2019-12-18 15:28:09,983 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 4712 transitions. Word has length 17 [2019-12-18 15:28:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:28:09,983 INFO L462 AbstractCegarLoop]: Abstraction has 2072 states and 4712 transitions. [2019-12-18 15:28:09,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:28:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 4712 transitions. [2019-12-18 15:28:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:28:09,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:28:09,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:28:09,985 INFO L410 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]=== [2019-12-18 15:28:09,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:28:09,985 INFO L82 PathProgramCache]: Analyzing trace with hash -44171423, now seen corresponding path program 7 times [2019-12-18 15:28:09,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:28:09,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792411979] [2019-12-18 15:28:09,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:28:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:28:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:28:10,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792411979] [2019-12-18 15:28:10,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:28:10,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:28:10,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223901114] [2019-12-18 15:28:10,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:28:10,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:28:10,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:28:10,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:28:10,687 INFO L87 Difference]: Start difference. First operand 2072 states and 4712 transitions. Second operand 16 states. [2019-12-18 15:28:11,593 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-12-18 15:28:12,472 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 63 [2019-12-18 15:28:12,661 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2019-12-18 15:28:12,955 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-12-18 15:28:13,224 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 59 [2019-12-18 15:28:13,442 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 81 [2019-12-18 15:28:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:28:18,076 INFO L93 Difference]: Finished difference Result 3479 states and 7891 transitions. [2019-12-18 15:28:18,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 15:28:18,076 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-18 15:28:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:28:18,081 INFO L225 Difference]: With dead ends: 3479 [2019-12-18 15:28:18,081 INFO L226 Difference]: Without dead ends: 3479 [2019-12-18 15:28:18,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=449, Invalid=1531, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 15:28:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2019-12-18 15:28:18,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 2080. [2019-12-18 15:28:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2080 states. [2019-12-18 15:28:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 4729 transitions. [2019-12-18 15:28:18,118 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 4729 transitions. Word has length 17 [2019-12-18 15:28:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:28:18,118 INFO L462 AbstractCegarLoop]: Abstraction has 2080 states and 4729 transitions. [2019-12-18 15:28:18,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:28:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 4729 transitions. [2019-12-18 15:28:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:28:18,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:28:18,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:28:18,120 INFO L410 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]=== [2019-12-18 15:28:18,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:28:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1920355727, now seen corresponding path program 8 times [2019-12-18 15:28:18,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:28:18,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511529527] [2019-12-18 15:28:18,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:28:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:28:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:28:18,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511529527] [2019-12-18 15:28:18,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:28:18,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:28:18,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933494983] [2019-12-18 15:28:18,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:28:18,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:28:18,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:28:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:28:18,536 INFO L87 Difference]: Start difference. First operand 2080 states and 4729 transitions. Second operand 15 states. [2019-12-18 15:28:19,275 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 47 [2019-12-18 15:28:19,805 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-12-18 15:28:20,162 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-12-18 15:28:20,443 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 56 [2019-12-18 15:28:21,130 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 50 [2019-12-18 15:28:21,891 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 58 [2019-12-18 15:28:22,359 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2019-12-18 15:28:22,632 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 59 [2019-12-18 15:28:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:28:24,779 INFO L93 Difference]: Finished difference Result 3681 states and 8377 transitions. [2019-12-18 15:28:24,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 15:28:24,780 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-18 15:28:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:28:24,784 INFO L225 Difference]: With dead ends: 3681 [2019-12-18 15:28:24,784 INFO L226 Difference]: Without dead ends: 3681 [2019-12-18 15:28:24,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=399, Invalid=1161, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 15:28:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2019-12-18 15:28:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 2034. [2019-12-18 15:28:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-12-18 15:28:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 4621 transitions. [2019-12-18 15:28:24,809 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 4621 transitions. Word has length 17 [2019-12-18 15:28:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:28:24,809 INFO L462 AbstractCegarLoop]: Abstraction has 2034 states and 4621 transitions. [2019-12-18 15:28:24,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:28:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 4621 transitions. [2019-12-18 15:28:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:28:24,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:28:24,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:28:24,810 INFO L410 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]=== [2019-12-18 15:28:24,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:28:24,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1524757119, now seen corresponding path program 9 times [2019-12-18 15:28:24,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:28:24,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927475720] [2019-12-18 15:28:24,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:28:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:28:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:28:25,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927475720] [2019-12-18 15:28:25,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:28:25,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:28:25,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276257875] [2019-12-18 15:28:25,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:28:25,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:28:25,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:28:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:28:25,455 INFO L87 Difference]: Start difference. First operand 2034 states and 4621 transitions. Second operand 16 states. [2019-12-18 15:28:26,666 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-12-18 15:28:26,964 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2019-12-18 15:28:27,381 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 [2019-12-18 15:28:28,815 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-12-18 15:28:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:28:32,207 INFO L93 Difference]: Finished difference Result 3202 states and 7276 transitions. [2019-12-18 15:28:32,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 15:28:32,208 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-18 15:28:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:28:32,213 INFO L225 Difference]: With dead ends: 3202 [2019-12-18 15:28:32,213 INFO L226 Difference]: Without dead ends: 3202 [2019-12-18 15:28:32,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 15:28:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2019-12-18 15:28:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 2044. [2019-12-18 15:28:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2019-12-18 15:28:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 4644 transitions. [2019-12-18 15:28:32,250 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 4644 transitions. Word has length 17 [2019-12-18 15:28:32,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:28:32,250 INFO L462 AbstractCegarLoop]: Abstraction has 2044 states and 4644 transitions. [2019-12-18 15:28:32,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:28:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 4644 transitions. [2019-12-18 15:28:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:28:32,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:28:32,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:28:32,252 INFO L410 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]=== [2019-12-18 15:28:32,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:28:32,252 INFO L82 PathProgramCache]: Analyzing trace with hash -805683027, now seen corresponding path program 10 times [2019-12-18 15:28:32,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:28:32,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326582354] [2019-12-18 15:28:32,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:28:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:28:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:28:32,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326582354] [2019-12-18 15:28:32,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:28:32,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:28:32,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150387833] [2019-12-18 15:28:32,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:28:32,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:28:32,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:28:32,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:28:32,708 INFO L87 Difference]: Start difference. First operand 2044 states and 4644 transitions. Second operand 15 states. [2019-12-18 15:28:34,015 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2019-12-18 15:28:34,436 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2019-12-18 15:28:35,461 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2019-12-18 15:28:35,780 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2019-12-18 15:28:36,083 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-12-18 15:28:36,335 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 58 [2019-12-18 15:28:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:28:38,223 INFO L93 Difference]: Finished difference Result 3414 states and 7783 transitions. [2019-12-18 15:28:38,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 15:28:38,223 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-18 15:28:38,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:28:38,229 INFO L225 Difference]: With dead ends: 3414 [2019-12-18 15:28:38,229 INFO L226 Difference]: Without dead ends: 3414 [2019-12-18 15:28:38,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=358, Invalid=1124, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:28:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2019-12-18 15:28:38,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 2034. [2019-12-18 15:28:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-12-18 15:28:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 4621 transitions. [2019-12-18 15:28:38,257 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 4621 transitions. Word has length 17 [2019-12-18 15:28:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:28:38,257 INFO L462 AbstractCegarLoop]: Abstraction has 2034 states and 4621 transitions. [2019-12-18 15:28:38,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:28:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 4621 transitions. [2019-12-18 15:28:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:28:38,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:28:38,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:28:38,259 INFO L410 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]=== [2019-12-18 15:28:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:28:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1804550017, now seen corresponding path program 11 times [2019-12-18 15:28:38,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:28:38,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15553676] [2019-12-18 15:28:38,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:28:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:28:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:28:38,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15553676] [2019-12-18 15:28:38,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:28:38,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:28:38,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009151700] [2019-12-18 15:28:38,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:28:38,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:28:38,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:28:38,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:28:38,634 INFO L87 Difference]: Start difference. First operand 2034 states and 4621 transitions. Second operand 15 states. [2019-12-18 15:28:40,340 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2019-12-18 15:28:40,615 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2019-12-18 15:28:41,686 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2019-12-18 15:28:42,117 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-12-18 15:28:42,425 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-12-18 15:28:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:28:44,896 INFO L93 Difference]: Finished difference Result 3268 states and 7418 transitions. [2019-12-18 15:28:44,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 15:28:44,896 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-18 15:28:44,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:28:44,901 INFO L225 Difference]: With dead ends: 3268 [2019-12-18 15:28:44,901 INFO L226 Difference]: Without dead ends: 3268 [2019-12-18 15:28:44,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:28:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3268 states. [2019-12-18 15:28:44,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3268 to 2044. [2019-12-18 15:28:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2019-12-18 15:28:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 4643 transitions. [2019-12-18 15:28:44,926 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 4643 transitions. Word has length 17 [2019-12-18 15:28:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:28:44,926 INFO L462 AbstractCegarLoop]: Abstraction has 2044 states and 4643 transitions. [2019-12-18 15:28:44,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:28:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 4643 transitions. [2019-12-18 15:28:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:28:44,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:28:44,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:28:44,928 INFO L410 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]=== [2019-12-18 15:28:44,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:28:44,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2018416871, now seen corresponding path program 12 times [2019-12-18 15:28:44,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:28:44,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589607883] [2019-12-18 15:28:44,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:28:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:28:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:28:45,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589607883] [2019-12-18 15:28:45,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:28:45,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:28:45,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156356628] [2019-12-18 15:28:45,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:28:45,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:28:45,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:28:45,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:28:45,338 INFO L87 Difference]: Start difference. First operand 2044 states and 4643 transitions. Second operand 15 states. [2019-12-18 15:28:46,915 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2019-12-18 15:28:47,163 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 59 [2019-12-18 15:28:48,096 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2019-12-18 15:28:48,483 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-12-18 15:28:48,766 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 62 [2019-12-18 15:28:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:28:50,647 INFO L93 Difference]: Finished difference Result 3139 states and 7147 transitions. [2019-12-18 15:28:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 15:28:50,647 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-18 15:28:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:28:50,652 INFO L225 Difference]: With dead ends: 3139 [2019-12-18 15:28:50,653 INFO L226 Difference]: Without dead ends: 3139 [2019-12-18 15:28:50,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 15:28:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-12-18 15:28:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2044. [2019-12-18 15:28:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2019-12-18 15:28:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 4643 transitions. [2019-12-18 15:28:50,696 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 4643 transitions. Word has length 17 [2019-12-18 15:28:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:28:50,696 INFO L462 AbstractCegarLoop]: Abstraction has 2044 states and 4643 transitions. [2019-12-18 15:28:50,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:28:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 4643 transitions. [2019-12-18 15:28:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:28:50,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:28:50,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:28:50,697 INFO L410 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]=== [2019-12-18 15:28:50,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:28:50,697 INFO L82 PathProgramCache]: Analyzing trace with hash 615719335, now seen corresponding path program 13 times [2019-12-18 15:28:50,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:28:50,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528179810] [2019-12-18 15:28:50,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:28:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:28:51,087 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2019-12-18 15:28:51,398 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-12-18 15:28:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:28:51,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528179810] [2019-12-18 15:28:51,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:28:51,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:28:51,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252337604] [2019-12-18 15:28:51,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:28:51,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:28:51,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:28:51,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:28:51,557 INFO L87 Difference]: Start difference. First operand 2044 states and 4643 transitions. Second operand 16 states. [2019-12-18 15:28:52,165 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-12-18 15:28:52,593 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-12-18 15:28:52,727 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-12-18 15:28:53,088 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 68 [2019-12-18 15:28:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:28:56,218 INFO L93 Difference]: Finished difference Result 3259 states and 7401 transitions. [2019-12-18 15:28:56,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:28:56,219 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-18 15:28:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:28:56,224 INFO L225 Difference]: With dead ends: 3259 [2019-12-18 15:28:56,224 INFO L226 Difference]: Without dead ends: 3259 [2019-12-18 15:28:56,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:28:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2019-12-18 15:28:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 2081. [2019-12-18 15:28:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-12-18 15:28:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 4732 transitions. [2019-12-18 15:28:56,259 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 4732 transitions. Word has length 17 [2019-12-18 15:28:56,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:28:56,260 INFO L462 AbstractCegarLoop]: Abstraction has 2081 states and 4732 transitions. [2019-12-18 15:28:56,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:28:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 4732 transitions. [2019-12-18 15:28:56,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:28:56,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:28:56,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:28:56,261 INFO L410 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]=== [2019-12-18 15:28:56,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:28:56,261 INFO L82 PathProgramCache]: Analyzing trace with hash -506041241, now seen corresponding path program 14 times [2019-12-18 15:28:56,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:28:56,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294779621] [2019-12-18 15:28:56,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:28:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:28:56,674 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2019-12-18 15:28:56,986 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-12-18 15:28:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:28:57,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294779621] [2019-12-18 15:28:57,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:28:57,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:28:57,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498172687] [2019-12-18 15:28:57,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:28:57,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:28:57,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:28:57,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:28:57,152 INFO L87 Difference]: Start difference. First operand 2081 states and 4732 transitions. Second operand 16 states. [2019-12-18 15:28:57,712 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-12-18 15:28:57,859 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-12-18 15:28:58,116 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-12-18 15:28:58,573 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-12-18 15:28:58,712 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-12-18 15:28:59,088 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 68 [2019-12-18 15:29:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:02,051 INFO L93 Difference]: Finished difference Result 3683 states and 8316 transitions. [2019-12-18 15:29:02,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 15:29:02,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-18 15:29:02,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:02,056 INFO L225 Difference]: With dead ends: 3683 [2019-12-18 15:29:02,057 INFO L226 Difference]: Without dead ends: 3683 [2019-12-18 15:29:02,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 15:29:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2019-12-18 15:29:02,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 2076. [2019-12-18 15:29:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2076 states. [2019-12-18 15:29:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 4717 transitions. [2019-12-18 15:29:02,082 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 4717 transitions. Word has length 17 [2019-12-18 15:29:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:02,082 INFO L462 AbstractCegarLoop]: Abstraction has 2076 states and 4717 transitions. [2019-12-18 15:29:02,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:29:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 4717 transitions. [2019-12-18 15:29:02,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:29:02,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:02,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:02,083 INFO L410 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]=== [2019-12-18 15:29:02,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:02,083 INFO L82 PathProgramCache]: Analyzing trace with hash 956680283, now seen corresponding path program 15 times [2019-12-18 15:29:02,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:02,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575849540] [2019-12-18 15:29:02,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:02,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575849540] [2019-12-18 15:29:02,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:02,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:29:02,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640832910] [2019-12-18 15:29:02,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:29:02,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:02,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:29:02,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:29:02,952 INFO L87 Difference]: Start difference. First operand 2076 states and 4717 transitions. Second operand 16 states. [2019-12-18 15:29:03,611 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-12-18 15:29:04,085 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2019-12-18 15:29:04,213 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-12-18 15:29:04,605 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 75 [2019-12-18 15:29:05,734 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2019-12-18 15:29:06,065 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2019-12-18 15:29:08,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:08,476 INFO L93 Difference]: Finished difference Result 3499 states and 7922 transitions. [2019-12-18 15:29:08,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:29:08,476 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-18 15:29:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:08,481 INFO L225 Difference]: With dead ends: 3499 [2019-12-18 15:29:08,482 INFO L226 Difference]: Without dead ends: 3499 [2019-12-18 15:29:08,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:29:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3499 states. [2019-12-18 15:29:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3499 to 2078. [2019-12-18 15:29:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2078 states. [2019-12-18 15:29:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 4721 transitions. [2019-12-18 15:29:08,510 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 4721 transitions. Word has length 17 [2019-12-18 15:29:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:08,510 INFO L462 AbstractCegarLoop]: Abstraction has 2078 states and 4721 transitions. [2019-12-18 15:29:08,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:29:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 4721 transitions. [2019-12-18 15:29:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:29:08,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:08,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:08,511 INFO L410 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]=== [2019-12-18 15:29:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash 617313511, now seen corresponding path program 16 times [2019-12-18 15:29:08,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:08,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246809770] [2019-12-18 15:29:08,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:09,140 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-12-18 15:29:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:09,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246809770] [2019-12-18 15:29:09,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:09,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:29:09,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178952589] [2019-12-18 15:29:09,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:29:09,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:09,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:29:09,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:29:09,317 INFO L87 Difference]: Start difference. First operand 2078 states and 4721 transitions. Second operand 16 states. [2019-12-18 15:29:10,061 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-12-18 15:29:10,410 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 54 [2019-12-18 15:29:10,883 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 70 [2019-12-18 15:29:11,033 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 43 [2019-12-18 15:29:11,417 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-12-18 15:29:12,708 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 46 [2019-12-18 15:29:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:15,063 INFO L93 Difference]: Finished difference Result 3457 states and 7831 transitions. [2019-12-18 15:29:15,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 15:29:15,063 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-18 15:29:15,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:15,068 INFO L225 Difference]: With dead ends: 3457 [2019-12-18 15:29:15,068 INFO L226 Difference]: Without dead ends: 3457 [2019-12-18 15:29:15,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=283, Invalid=907, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 15:29:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2019-12-18 15:29:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 2074. [2019-12-18 15:29:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-12-18 15:29:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 4711 transitions. [2019-12-18 15:29:15,097 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 4711 transitions. Word has length 17 [2019-12-18 15:29:15,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:15,097 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 4711 transitions. [2019-12-18 15:29:15,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:29:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 4711 transitions. [2019-12-18 15:29:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:29:15,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:15,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:15,098 INFO L410 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]=== [2019-12-18 15:29:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:15,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1713126635, now seen corresponding path program 17 times [2019-12-18 15:29:15,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:15,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972210913] [2019-12-18 15:29:15,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:15,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972210913] [2019-12-18 15:29:15,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:15,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:29:15,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307489459] [2019-12-18 15:29:15,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:29:15,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:15,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:29:15,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:29:15,660 INFO L87 Difference]: Start difference. First operand 2074 states and 4711 transitions. Second operand 15 states. [2019-12-18 15:29:16,539 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2019-12-18 15:29:17,139 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 50 [2019-12-18 15:29:17,517 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-12-18 15:29:18,199 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2019-12-18 15:29:18,644 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2019-12-18 15:29:18,945 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 53 [2019-12-18 15:29:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:20,984 INFO L93 Difference]: Finished difference Result 3614 states and 8202 transitions. [2019-12-18 15:29:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 15:29:20,986 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-18 15:29:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:20,990 INFO L225 Difference]: With dead ends: 3614 [2019-12-18 15:29:20,990 INFO L226 Difference]: Without dead ends: 3614 [2019-12-18 15:29:20,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=275, Invalid=781, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 15:29:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3614 states. [2019-12-18 15:29:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3614 to 1953. [2019-12-18 15:29:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2019-12-18 15:29:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 4413 transitions. [2019-12-18 15:29:21,014 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 4413 transitions. Word has length 17 [2019-12-18 15:29:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:21,015 INFO L462 AbstractCegarLoop]: Abstraction has 1953 states and 4413 transitions. [2019-12-18 15:29:21,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:29:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 4413 transitions. [2019-12-18 15:29:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:29:21,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:21,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:21,016 INFO L410 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]=== [2019-12-18 15:29:21,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:21,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1192920703, now seen corresponding path program 1 times [2019-12-18 15:29:21,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:21,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315443368] [2019-12-18 15:29:21,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:21,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315443368] [2019-12-18 15:29:21,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:21,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:29:21,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902226402] [2019-12-18 15:29:21,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:29:21,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:21,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:29:21,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:29:21,180 INFO L87 Difference]: Start difference. First operand 1953 states and 4413 transitions. Second operand 7 states. [2019-12-18 15:29:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:22,285 INFO L93 Difference]: Finished difference Result 2263 states and 5079 transitions. [2019-12-18 15:29:22,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:29:22,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-18 15:29:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:22,289 INFO L225 Difference]: With dead ends: 2263 [2019-12-18 15:29:22,289 INFO L226 Difference]: Without dead ends: 2263 [2019-12-18 15:29:22,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:29:22,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2019-12-18 15:29:22,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1962. [2019-12-18 15:29:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-12-18 15:29:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 4431 transitions. [2019-12-18 15:29:22,310 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 4431 transitions. Word has length 18 [2019-12-18 15:29:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:22,310 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 4431 transitions. [2019-12-18 15:29:22,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:29:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 4431 transitions. [2019-12-18 15:29:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:29:22,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:22,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:22,311 INFO L410 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]=== [2019-12-18 15:29:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:22,311 INFO L82 PathProgramCache]: Analyzing trace with hash -745285229, now seen corresponding path program 2 times [2019-12-18 15:29:22,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:22,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431785215] [2019-12-18 15:29:22,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:22,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431785215] [2019-12-18 15:29:22,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:22,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:29:22,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937183222] [2019-12-18 15:29:22,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:29:22,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:22,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:29:22,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:29:22,508 INFO L87 Difference]: Start difference. First operand 1962 states and 4431 transitions. Second operand 12 states. [2019-12-18 15:29:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:24,606 INFO L93 Difference]: Finished difference Result 2548 states and 5698 transitions. [2019-12-18 15:29:24,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:29:24,607 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-18 15:29:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:24,610 INFO L225 Difference]: With dead ends: 2548 [2019-12-18 15:29:24,610 INFO L226 Difference]: Without dead ends: 2548 [2019-12-18 15:29:24,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:29:24,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2019-12-18 15:29:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2040. [2019-12-18 15:29:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2019-12-18 15:29:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 4614 transitions. [2019-12-18 15:29:24,632 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 4614 transitions. Word has length 18 [2019-12-18 15:29:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:24,632 INFO L462 AbstractCegarLoop]: Abstraction has 2040 states and 4614 transitions. [2019-12-18 15:29:24,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:29:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 4614 transitions. [2019-12-18 15:29:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:29:24,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:24,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:24,633 INFO L410 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]=== [2019-12-18 15:29:24,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash 214341567, now seen corresponding path program 3 times [2019-12-18 15:29:24,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:24,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523428249] [2019-12-18 15:29:24,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:24,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523428249] [2019-12-18 15:29:24,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:24,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:29:24,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180795718] [2019-12-18 15:29:24,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:29:24,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:24,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:29:24,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:29:24,864 INFO L87 Difference]: Start difference. First operand 2040 states and 4614 transitions. Second operand 11 states. [2019-12-18 15:29:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:27,803 INFO L93 Difference]: Finished difference Result 3088 states and 6899 transitions. [2019-12-18 15:29:27,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 15:29:27,803 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-12-18 15:29:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:27,806 INFO L225 Difference]: With dead ends: 3088 [2019-12-18 15:29:27,806 INFO L226 Difference]: Without dead ends: 3088 [2019-12-18 15:29:27,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:29:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2019-12-18 15:29:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 2055. [2019-12-18 15:29:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-12-18 15:29:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 4645 transitions. [2019-12-18 15:29:27,831 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 4645 transitions. Word has length 18 [2019-12-18 15:29:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:27,831 INFO L462 AbstractCegarLoop]: Abstraction has 2055 states and 4645 transitions. [2019-12-18 15:29:27,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:29:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 4645 transitions. [2019-12-18 15:29:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:29:27,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:27,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:27,833 INFO L410 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]=== [2019-12-18 15:29:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:27,833 INFO L82 PathProgramCache]: Analyzing trace with hash 269048999, now seen corresponding path program 4 times [2019-12-18 15:29:27,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:27,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395707772] [2019-12-18 15:29:27,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:28,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395707772] [2019-12-18 15:29:28,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:28,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:29:28,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52643365] [2019-12-18 15:29:28,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:29:28,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:28,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:29:28,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:29:28,063 INFO L87 Difference]: Start difference. First operand 2055 states and 4645 transitions. Second operand 11 states. [2019-12-18 15:29:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:31,177 INFO L93 Difference]: Finished difference Result 3607 states and 7988 transitions. [2019-12-18 15:29:31,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:29:31,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-12-18 15:29:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:31,182 INFO L225 Difference]: With dead ends: 3607 [2019-12-18 15:29:31,182 INFO L226 Difference]: Without dead ends: 3607 [2019-12-18 15:29:31,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:29:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-18 15:29:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 2067. [2019-12-18 15:29:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2019-12-18 15:29:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 4669 transitions. [2019-12-18 15:29:31,211 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 4669 transitions. Word has length 18 [2019-12-18 15:29:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:31,211 INFO L462 AbstractCegarLoop]: Abstraction has 2067 states and 4669 transitions. [2019-12-18 15:29:31,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:29:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 4669 transitions. [2019-12-18 15:29:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:29:31,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:31,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:31,212 INFO L410 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]=== [2019-12-18 15:29:31,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:31,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1723864365, now seen corresponding path program 5 times [2019-12-18 15:29:31,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:31,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139859792] [2019-12-18 15:29:31,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:31,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139859792] [2019-12-18 15:29:31,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:31,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:29:31,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355899398] [2019-12-18 15:29:31,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:29:31,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:31,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:29:31,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:29:31,528 INFO L87 Difference]: Start difference. First operand 2067 states and 4669 transitions. Second operand 16 states. [2019-12-18 15:29:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:37,711 INFO L93 Difference]: Finished difference Result 3942 states and 8730 transitions. [2019-12-18 15:29:37,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 15:29:37,712 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-18 15:29:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:37,716 INFO L225 Difference]: With dead ends: 3942 [2019-12-18 15:29:37,716 INFO L226 Difference]: Without dead ends: 3942 [2019-12-18 15:29:37,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1040, Invalid=2742, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 15:29:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2019-12-18 15:29:37,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 2045. [2019-12-18 15:29:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-18 15:29:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4618 transitions. [2019-12-18 15:29:37,742 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4618 transitions. Word has length 18 [2019-12-18 15:29:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:37,742 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4618 transitions. [2019-12-18 15:29:37,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:29:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4618 transitions. [2019-12-18 15:29:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:29:37,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:37,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:37,743 INFO L410 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]=== [2019-12-18 15:29:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1176401105, now seen corresponding path program 6 times [2019-12-18 15:29:37,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:37,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141059276] [2019-12-18 15:29:37,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:38,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141059276] [2019-12-18 15:29:38,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:38,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:29:38,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96568233] [2019-12-18 15:29:38,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:29:38,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:38,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:29:38,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:29:38,056 INFO L87 Difference]: Start difference. First operand 2045 states and 4618 transitions. Second operand 17 states. [2019-12-18 15:29:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:45,519 INFO L93 Difference]: Finished difference Result 3792 states and 8403 transitions. [2019-12-18 15:29:45,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-18 15:29:45,520 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-12-18 15:29:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:45,525 INFO L225 Difference]: With dead ends: 3792 [2019-12-18 15:29:45,525 INFO L226 Difference]: Without dead ends: 3792 [2019-12-18 15:29:45,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1123, Invalid=3167, Unknown=0, NotChecked=0, Total=4290 [2019-12-18 15:29:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2019-12-18 15:29:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 2039. [2019-12-18 15:29:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-12-18 15:29:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 4605 transitions. [2019-12-18 15:29:45,550 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 4605 transitions. Word has length 18 [2019-12-18 15:29:45,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:45,550 INFO L462 AbstractCegarLoop]: Abstraction has 2039 states and 4605 transitions. [2019-12-18 15:29:45,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:29:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 4605 transitions. [2019-12-18 15:29:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:29:45,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:45,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:45,552 INFO L410 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]=== [2019-12-18 15:29:45,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:45,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1238158271, now seen corresponding path program 7 times [2019-12-18 15:29:45,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:45,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929487333] [2019-12-18 15:29:45,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:45,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929487333] [2019-12-18 15:29:45,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:45,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:29:45,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465288588] [2019-12-18 15:29:45,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:29:45,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:45,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:29:45,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:29:45,899 INFO L87 Difference]: Start difference. First operand 2039 states and 4605 transitions. Second operand 16 states. [2019-12-18 15:29:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:52,725 INFO L93 Difference]: Finished difference Result 3702 states and 8214 transitions. [2019-12-18 15:29:52,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-18 15:29:52,725 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-18 15:29:52,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:52,730 INFO L225 Difference]: With dead ends: 3702 [2019-12-18 15:29:52,730 INFO L226 Difference]: Without dead ends: 3702 [2019-12-18 15:29:52,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1182, Invalid=3374, Unknown=0, NotChecked=0, Total=4556 [2019-12-18 15:29:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2019-12-18 15:29:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 2023. [2019-12-18 15:29:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-12-18 15:29:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 4570 transitions. [2019-12-18 15:29:52,755 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 4570 transitions. Word has length 18 [2019-12-18 15:29:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:52,755 INFO L462 AbstractCegarLoop]: Abstraction has 2023 states and 4570 transitions. [2019-12-18 15:29:52,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:29:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 4570 transitions. [2019-12-18 15:29:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:29:52,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:52,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:52,757 INFO L410 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]=== [2019-12-18 15:29:52,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:52,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2003239487, now seen corresponding path program 8 times [2019-12-18 15:29:52,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:52,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987605237] [2019-12-18 15:29:52,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:52,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987605237] [2019-12-18 15:29:52,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:52,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:29:52,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86769537] [2019-12-18 15:29:52,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:29:52,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:52,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:29:52,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:29:52,957 INFO L87 Difference]: Start difference. First operand 2023 states and 4570 transitions. Second operand 10 states. [2019-12-18 15:29:53,584 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-12-18 15:29:53,983 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-18 15:29:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:55,069 INFO L93 Difference]: Finished difference Result 2350 states and 5276 transitions. [2019-12-18 15:29:55,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:29:55,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-18 15:29:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:55,073 INFO L225 Difference]: With dead ends: 2350 [2019-12-18 15:29:55,073 INFO L226 Difference]: Without dead ends: 2350 [2019-12-18 15:29:55,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-12-18 15:29:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2019-12-18 15:29:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2032. [2019-12-18 15:29:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2032 states. [2019-12-18 15:29:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 4589 transitions. [2019-12-18 15:29:55,092 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 4589 transitions. Word has length 18 [2019-12-18 15:29:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:55,093 INFO L462 AbstractCegarLoop]: Abstraction has 2032 states and 4589 transitions. [2019-12-18 15:29:55,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:29:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 4589 transitions. [2019-12-18 15:29:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:29:55,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:55,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:55,094 INFO L410 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]=== [2019-12-18 15:29:55,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:55,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1948532055, now seen corresponding path program 9 times [2019-12-18 15:29:55,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:55,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758317871] [2019-12-18 15:29:55,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:55,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758317871] [2019-12-18 15:29:55,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:55,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:29:55,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665748372] [2019-12-18 15:29:55,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:29:55,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:55,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:29:55,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:29:55,272 INFO L87 Difference]: Start difference. First operand 2032 states and 4589 transitions. Second operand 10 states. [2019-12-18 15:29:55,956 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-18 15:29:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:29:57,183 INFO L93 Difference]: Finished difference Result 2560 states and 5718 transitions. [2019-12-18 15:29:57,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:29:57,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-18 15:29:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:29:57,187 INFO L225 Difference]: With dead ends: 2560 [2019-12-18 15:29:57,187 INFO L226 Difference]: Without dead ends: 2560 [2019-12-18 15:29:57,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:29:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2019-12-18 15:29:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2051. [2019-12-18 15:29:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2019-12-18 15:29:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 4630 transitions. [2019-12-18 15:29:57,208 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 4630 transitions. Word has length 18 [2019-12-18 15:29:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:29:57,208 INFO L462 AbstractCegarLoop]: Abstraction has 2051 states and 4630 transitions. [2019-12-18 15:29:57,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:29:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 4630 transitions. [2019-12-18 15:29:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:29:57,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:29:57,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:29:57,210 INFO L410 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]=== [2019-12-18 15:29:57,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:29:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash 353521877, now seen corresponding path program 10 times [2019-12-18 15:29:57,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:29:57,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659559943] [2019-12-18 15:29:57,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:29:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:29:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:29:57,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659559943] [2019-12-18 15:29:57,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:29:57,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:29:57,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977998085] [2019-12-18 15:29:57,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:29:57,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:29:57,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:29:57,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:29:57,514 INFO L87 Difference]: Start difference. First operand 2051 states and 4630 transitions. Second operand 15 states. Received shutdown request... [2019-12-18 15:30:01,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 15:30:01,668 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 15:30:01,672 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 15:30:01,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:30:01 BasicIcfg [2019-12-18 15:30:01,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:30:01,674 INFO L168 Benchmark]: Toolchain (without parser) took 245682.17 ms. Allocated memory was 146.3 MB in the beginning and 342.9 MB in the end (delta: 196.6 MB). Free memory was 100.4 MB in the beginning and 171.6 MB in the end (delta: -71.2 MB). Peak memory consumption was 125.4 MB. Max. memory is 7.1 GB. [2019-12-18 15:30:01,674 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 15:30:01,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1028.36 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.4 MB in the beginning and 131.1 MB in the end (delta: -30.7 MB). Peak memory consumption was 35.1 MB. Max. memory is 7.1 GB. [2019-12-18 15:30:01,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.61 ms. Allocated memory is still 203.9 MB. Free memory was 131.1 MB in the beginning and 127.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:30:01,675 INFO L168 Benchmark]: Boogie Preprocessor took 78.67 ms. Allocated memory is still 203.9 MB. Free memory was 127.3 MB in the beginning and 123.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:30:01,676 INFO L168 Benchmark]: RCFGBuilder took 1101.51 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 123.5 MB in the beginning and 150.2 MB in the end (delta: -26.8 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:30:01,676 INFO L168 Benchmark]: TraceAbstraction took 243344.24 ms. Allocated memory was 234.9 MB in the beginning and 342.9 MB in the end (delta: 108.0 MB). Free memory was 150.2 MB in the beginning and 171.6 MB in the end (delta: -21.4 MB). Peak memory consumption was 86.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:30:01,678 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1028.36 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.4 MB in the beginning and 131.1 MB in the end (delta: -30.7 MB). Peak memory consumption was 35.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 119.61 ms. Allocated memory is still 203.9 MB. Free memory was 131.1 MB in the beginning and 127.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.67 ms. Allocated memory is still 203.9 MB. Free memory was 127.3 MB in the beginning and 123.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1101.51 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 123.5 MB in the beginning and 150.2 MB in the end (delta: -26.8 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243344.24 ms. Allocated memory was 234.9 MB in the beginning and 342.9 MB in the end (delta: 108.0 MB). Free memory was 150.2 MB in the beginning and 171.6 MB in the end (delta: -21.4 MB). Peak memory consumption was 86.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 26.1s, 415 ProgramPointsBefore, 103 ProgramPointsAfterwards, 443 TransitionsBefore, 121 TransitionsAfterwards, 30326 CoEnabledTransitionPairs, 14 FixpointIterations, 121 TrivialSequentialCompositions, 233 ConcurrentSequentialCompositions, 28 TrivialYvCompositions, 76 ConcurrentYvCompositions, 11 ChoiceCompositions, 15998 VarBasedMoverChecksPositive, 666 VarBasedMoverChecksNegative, 507 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.5s, 0 MoverChecksTotal, 106197 CheckedPairsTotal, 458 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 (2051states) and FLOYD_HOARE automaton (currently 32 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2061 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1087]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1087). Cancelled while BasicCegarLoop was constructing difference of abstraction (2051states) and FLOYD_HOARE automaton (currently 32 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2061 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (2051states) and FLOYD_HOARE automaton (currently 32 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2061 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1085]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1085). Cancelled while BasicCegarLoop was constructing difference of abstraction (2051states) and FLOYD_HOARE automaton (currently 32 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2061 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2051states) and FLOYD_HOARE automaton (currently 32 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2061 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2051states) and FLOYD_HOARE automaton (currently 32 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2061 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (2051states) and FLOYD_HOARE automaton (currently 32 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2061 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2051states) and FLOYD_HOARE automaton (currently 32 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2061 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (2051states) and FLOYD_HOARE automaton (currently 32 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2061 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1065). Cancelled while BasicCegarLoop was constructing difference of abstraction (2051states) and FLOYD_HOARE automaton (currently 32 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2061 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1089]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1089). Cancelled while BasicCegarLoop was constructing difference of abstraction (2051states) and FLOYD_HOARE automaton (currently 32 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2061 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 412 locations, 11 error locations. Result: TIMEOUT, OverallTime: 243.1s, OverallIterations: 50, TraceHistogramMax: 1, AutomataDifference: 194.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5354 SDtfs, 24924 SDslu, 14404 SDs, 0 SdLazy, 100301 SolverSat, 2227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1468 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 1419 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8963 ImplicationChecksByTransitivity, 85.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2081occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 49 MinimizatonAttempts, 48719 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 767 NumberOfCodeBlocks, 767 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 717 ConstructedInterpolants, 0 QuantifiedInterpolants, 291120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 50 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown