/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:13:28,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:13:28,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:13:28,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:13:28,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:13:28,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:13:28,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:13:28,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:13:28,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:13:28,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:13:28,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:13:28,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:13:28,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:13:28,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:13:28,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:13:28,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:13:28,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:13:28,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:13:28,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:13:28,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:13:28,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:13:28,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:13:28,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:13:28,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:13:28,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:13:28,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:13:28,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:13:28,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:13:28,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:13:28,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:13:28,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:13:28,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:13:28,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:13:28,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:13:28,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:13:28,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:13:28,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:13:28,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:13:28,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:13:28,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:13:28,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:13:28,494 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 23:13:28,512 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:13:28,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:13:28,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:13:28,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:13:28,514 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:13:28,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:13:28,515 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:13:28,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:13:28,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:13:28,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:13:28,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:13:28,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:13:28,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:13:28,516 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:13:28,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:13:28,517 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:13:28,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:13:28,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:13:28,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:13:28,517 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:13:28,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:13:28,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:13:28,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:13:28,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:13:28,518 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:13:28,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:13:28,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:13:28,519 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:13:28,519 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 23:13:28,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:13:28,520 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:13:28,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:13:28,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:13:28,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:13:28,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:13:28,839 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:13:28,839 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:13:28,840 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i [2019-12-27 23:13:28,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa2ffdda/d737631174264fa4a768f1bdaad39d68/FLAG19b03fb55 [2019-12-27 23:13:29,490 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:13:29,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i [2019-12-27 23:13:29,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa2ffdda/d737631174264fa4a768f1bdaad39d68/FLAG19b03fb55 [2019-12-27 23:13:29,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa2ffdda/d737631174264fa4a768f1bdaad39d68 [2019-12-27 23:13:29,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:13:29,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:13:29,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:13:29,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:13:29,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:13:29,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:13:29" (1/1) ... [2019-12-27 23:13:29,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1785c967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:29, skipping insertion in model container [2019-12-27 23:13:29,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:13:29" (1/1) ... [2019-12-27 23:13:29,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:13:29,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:13:30,009 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 23:13:30,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:13:30,395 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:13:30,409 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 23:13:30,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:13:30,628 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:13:30,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:30 WrapperNode [2019-12-27 23:13:30,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:13:30,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:13:30,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:13:30,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:13:30,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:30" (1/1) ... [2019-12-27 23:13:30,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:30" (1/1) ... [2019-12-27 23:13:30,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:13:30,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:13:30,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:13:30,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:13:30,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:30" (1/1) ... [2019-12-27 23:13:30,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:30" (1/1) ... [2019-12-27 23:13:30,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:30" (1/1) ... [2019-12-27 23:13:30,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:30" (1/1) ... [2019-12-27 23:13:30,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:30" (1/1) ... [2019-12-27 23:13:30,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:30" (1/1) ... [2019-12-27 23:13:30,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:30" (1/1) ... [2019-12-27 23:13:30,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:13:30,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:13:30,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:13:30,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:13:30,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:13:30,885 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2019-12-27 23:13:30,886 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2019-12-27 23:13:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:13:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-27 23:13:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:13:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 23:13:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:13:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-27 23:13:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 23:13:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:13:30,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:13:30,893 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:13:31,994 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:13:31,994 INFO L287 CfgBuilder]: Removed 40 assume(true) statements. [2019-12-27 23:13:31,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:13:31 BoogieIcfgContainer [2019-12-27 23:13:31,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:13:31,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:13:31,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:13:32,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:13:32,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:13:29" (1/3) ... [2019-12-27 23:13:32,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425b6ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:13:32, skipping insertion in model container [2019-12-27 23:13:32,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:30" (2/3) ... [2019-12-27 23:13:32,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425b6ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:13:32, skipping insertion in model container [2019-12-27 23:13:32,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:13:31" (3/3) ... [2019-12-27 23:13:32,006 INFO L109 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.i [2019-12-27 23:13:32,017 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:13:32,018 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:13:32,027 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-12-27 23:13:32,028 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:13:32,077 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,078 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,078 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,078 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,079 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,079 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,079 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,079 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,079 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,080 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,080 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,080 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,080 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,080 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,081 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,081 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,081 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,081 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,081 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,081 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,082 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,082 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,082 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,082 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,082 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,082 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,083 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,083 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,083 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,083 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,083 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,083 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,084 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,084 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,084 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,084 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,084 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,085 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,085 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,085 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,085 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,085 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,085 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,086 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,086 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,086 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,086 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,086 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,086 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,087 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,087 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,087 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,087 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,087 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,087 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,088 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,088 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,088 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,088 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,088 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,089 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,089 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,089 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,089 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,089 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,089 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,090 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,090 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,090 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,090 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,090 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,091 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,091 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,091 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,091 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,091 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,092 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,092 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,092 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,092 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,092 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,092 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,093 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,093 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,093 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,093 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,093 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,094 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,094 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,094 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,094 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,094 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,095 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,095 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,095 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,095 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,095 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,096 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,096 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,096 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,096 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,096 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,097 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,097 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,097 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,097 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,097 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,097 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,098 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,098 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,098 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,098 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,098 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,099 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,099 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,099 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,099 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,099 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,100 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,100 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,100 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,100 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,100 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,101 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,101 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,101 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,101 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,101 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,101 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,102 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,102 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,102 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,102 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,102 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,103 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,103 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,103 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,103 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,103 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,103 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,103 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,104 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,104 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,104 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,104 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,104 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,105 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,105 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,105 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,105 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,105 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,105 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,106 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,106 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,106 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,106 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,106 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,106 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,107 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,107 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,107 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,107 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,107 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,108 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,108 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,108 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,108 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,108 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,108 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,109 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,109 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,109 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,109 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,109 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,109 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,110 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,110 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,110 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,110 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,110 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,110 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,111 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,111 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,111 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,111 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,111 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,112 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,112 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,112 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,112 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,116 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,116 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,116 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,116 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,117 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,117 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,117 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,117 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,117 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,118 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,118 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,118 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,118 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,118 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,118 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,119 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,119 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,119 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,119 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,119 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,120 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,120 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,120 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,120 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,120 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,120 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,121 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,121 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,121 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,121 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,121 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,122 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,122 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,122 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,122 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,122 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,123 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,123 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,123 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,123 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,123 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,124 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,124 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,124 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:32,148 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-27 23:13:32,171 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:13:32,172 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:13:32,172 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:13:32,172 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:13:32,173 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:13:32,173 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:13:32,173 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:13:32,173 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:13:32,206 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 426 places, 455 transitions [2019-12-27 23:13:32,208 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 426 places, 455 transitions [2019-12-27 23:13:32,542 INFO L132 PetriNetUnfolder]: 33/454 cut-off events. [2019-12-27 23:13:32,542 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 23:13:32,568 INFO L76 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 454 events. 33/454 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1111 event pairs. 0/410 useless extension candidates. Maximal degree in co-relation 328. Up to 3 conditions per place. [2019-12-27 23:13:32,621 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 426 places, 455 transitions [2019-12-27 23:13:32,709 INFO L132 PetriNetUnfolder]: 33/454 cut-off events. [2019-12-27 23:13:32,709 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 23:13:32,724 INFO L76 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 454 events. 33/454 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1111 event pairs. 0/410 useless extension candidates. Maximal degree in co-relation 328. Up to 3 conditions per place. [2019-12-27 23:13:32,763 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 31742 [2019-12-27 23:13:32,764 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:13:34,238 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-27 23:13:34,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:13:34,266 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-27 23:13:34,266 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2019-12-27 23:13:34,559 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-27 23:13:34,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:13:34,573 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-27 23:13:34,574 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2019-12-27 23:13:36,737 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-27 23:13:36,754 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:13:36,756 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-27 23:13:36,756 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:74 [2019-12-27 23:13:38,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:13:38,316 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-27 23:13:38,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:13:38,394 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-27 23:13:38,395 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:172, output treesize:181 [2019-12-27 23:13:38,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:13:39,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:13:39,948 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-12-27 23:13:40,060 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-27 23:13:40,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:13:40,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:13:40,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:13:41,374 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-12-27 23:13:41,659 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2019-12-27 23:13:42,560 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-12-27 23:13:42,906 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-12-27 23:13:43,033 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-12-27 23:13:43,184 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-12-27 23:13:45,071 WARN L192 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 178 DAG size of output: 164 [2019-12-27 23:13:45,113 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-27 23:13:45,881 WARN L192 SmtUtils]: Spent 767.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-12-27 23:13:45,882 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:13:45,883 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-27 23:13:45,883 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:452, output treesize:494 [2019-12-27 23:13:46,580 WARN L192 SmtUtils]: Spent 696.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-12-27 23:13:46,623 INFO L206 etLargeBlockEncoding]: Checked pairs total: 73353 [2019-12-27 23:13:46,624 INFO L214 etLargeBlockEncoding]: Total number of compositions: 423 [2019-12-27 23:13:46,627 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 122 transitions [2019-12-27 23:13:46,686 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1490 states. [2019-12-27 23:13:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states. [2019-12-27 23:13:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 23:13:46,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:13:46,696 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 23:13:46,697 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-27 23:13:46,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:13:46,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1590, now seen corresponding path program 1 times [2019-12-27 23:13:46,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:13:46,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225313423] [2019-12-27 23:13:46,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:13:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:13:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:13:46,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225313423] [2019-12-27 23:13:46,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:13:46,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 23:13:46,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [113166321] [2019-12-27 23:13:46,827 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:13:46,832 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:13:46,841 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 2 states and 1 transitions. [2019-12-27 23:13:46,841 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:13:46,845 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:13:46,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 23:13:46,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:13:46,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 23:13:46,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 23:13:46,864 INFO L87 Difference]: Start difference. First operand 1490 states. Second operand 2 states. [2019-12-27 23:13:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:13:46,916 INFO L93 Difference]: Finished difference Result 1489 states and 3337 transitions. [2019-12-27 23:13:46,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 23:13:46,917 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 23:13:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:13:46,947 INFO L225 Difference]: With dead ends: 1489 [2019-12-27 23:13:46,947 INFO L226 Difference]: Without dead ends: 1469 [2019-12-27 23:13:46,948 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-27 23:13:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-12-27 23:13:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2019-12-27 23:13:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-12-27 23:13:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3296 transitions. [2019-12-27 23:13:47,091 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3296 transitions. Word has length 1 [2019-12-27 23:13:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:13:47,091 INFO L462 AbstractCegarLoop]: Abstraction has 1469 states and 3296 transitions. [2019-12-27 23:13:47,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 23:13:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3296 transitions. [2019-12-27 23:13:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 23:13:47,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:13:47,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 23:13:47,093 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-27 23:13:47,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:13:47,093 INFO L82 PathProgramCache]: Analyzing trace with hash -680447466, now seen corresponding path program 1 times [2019-12-27 23:13:47,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:13:47,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126587206] [2019-12-27 23:13:47,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:13:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:13:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:13:47,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126587206] [2019-12-27 23:13:47,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:13:47,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:13:47,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [210039172] [2019-12-27 23:13:47,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:13:47,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:13:47,227 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 7 states and 6 transitions. [2019-12-27 23:13:47,227 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:13:47,227 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:13:47,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:13:47,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:13:47,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:13:47,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:13:47,231 INFO L87 Difference]: Start difference. First operand 1469 states and 3296 transitions. Second operand 3 states. [2019-12-27 23:13:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:13:47,317 INFO L93 Difference]: Finished difference Result 2761 states and 6206 transitions. [2019-12-27 23:13:47,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:13:47,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-27 23:13:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:13:47,342 INFO L225 Difference]: With dead ends: 2761 [2019-12-27 23:13:47,342 INFO L226 Difference]: Without dead ends: 2761 [2019-12-27 23:13:47,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:13:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2019-12-27 23:13:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 1488. [2019-12-27 23:13:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-12-27 23:13:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3336 transitions. [2019-12-27 23:13:47,405 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3336 transitions. Word has length 6 [2019-12-27 23:13:47,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:13:47,405 INFO L462 AbstractCegarLoop]: Abstraction has 1488 states and 3336 transitions. [2019-12-27 23:13:47,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:13:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3336 transitions. [2019-12-27 23:13:47,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 23:13:47,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:13:47,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:13:47,407 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-27 23:13:47,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:13:47,408 INFO L82 PathProgramCache]: Analyzing trace with hash 380351230, now seen corresponding path program 1 times [2019-12-27 23:13:47,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:13:47,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512324953] [2019-12-27 23:13:47,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:13:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:13:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:13:47,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512324953] [2019-12-27 23:13:47,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:13:47,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:13:47,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1754916490] [2019-12-27 23:13:47,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:13:47,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:13:47,541 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 23:13:47,541 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:13:47,541 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:13:47,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:13:47,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:13:47,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:13:47,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:13:47,543 INFO L87 Difference]: Start difference. First operand 1488 states and 3336 transitions. Second operand 3 states. [2019-12-27 23:13:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:13:47,566 INFO L93 Difference]: Finished difference Result 1488 states and 3317 transitions. [2019-12-27 23:13:47,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:13:47,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 23:13:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:13:47,575 INFO L225 Difference]: With dead ends: 1488 [2019-12-27 23:13:47,576 INFO L226 Difference]: Without dead ends: 1488 [2019-12-27 23:13:47,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:13:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-12-27 23:13:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2019-12-27 23:13:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-12-27 23:13:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3317 transitions. [2019-12-27 23:13:47,620 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3317 transitions. Word has length 7 [2019-12-27 23:13:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:13:47,620 INFO L462 AbstractCegarLoop]: Abstraction has 1488 states and 3317 transitions. [2019-12-27 23:13:47,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:13:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3317 transitions. [2019-12-27 23:13:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 23:13:47,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:13:47,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:13:47,622 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-27 23:13:47,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:13:47,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1082037222, now seen corresponding path program 1 times [2019-12-27 23:13:47,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:13:47,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859516325] [2019-12-27 23:13:47,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:13:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:13:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:13:47,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859516325] [2019-12-27 23:13:47,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:13:47,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:13:47,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [869673432] [2019-12-27 23:13:47,782 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:13:47,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:13:47,784 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 23:13:47,785 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:13:47,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:13:47,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:13:47,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:13:47,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:13:47,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:13:47,786 INFO L87 Difference]: Start difference. First operand 1488 states and 3317 transitions. Second operand 6 states. [2019-12-27 23:13:48,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:13:48,385 INFO L93 Difference]: Finished difference Result 1874 states and 4178 transitions. [2019-12-27 23:13:48,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:13:48,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-12-27 23:13:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:13:48,396 INFO L225 Difference]: With dead ends: 1874 [2019-12-27 23:13:48,397 INFO L226 Difference]: Without dead ends: 1874 [2019-12-27 23:13:48,397 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-27 23:13:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2019-12-27 23:13:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1595. [2019-12-27 23:13:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-27 23:13:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3562 transitions. [2019-12-27 23:13:48,445 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3562 transitions. Word has length 8 [2019-12-27 23:13:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:13:48,485 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 3562 transitions. [2019-12-27 23:13:48,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:13:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3562 transitions. [2019-12-27 23:13:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 23:13:48,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:13:48,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:13:48,488 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-27 23:13:48,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:13:48,489 INFO L82 PathProgramCache]: Analyzing trace with hash -455345386, now seen corresponding path program 1 times [2019-12-27 23:13:48,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:13:48,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733153361] [2019-12-27 23:13:48,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:13:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:13:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:13:48,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733153361] [2019-12-27 23:13:48,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:13:48,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:13:48,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1842415012] [2019-12-27 23:13:48,551 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:13:48,552 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:13:48,554 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 23:13:48,554 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:13:48,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:13:48,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:13:48,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:13:48,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:13:48,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:13:48,557 INFO L87 Difference]: Start difference. First operand 1595 states and 3562 transitions. Second operand 3 states. [2019-12-27 23:13:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:13:48,624 INFO L93 Difference]: Finished difference Result 2622 states and 5848 transitions. [2019-12-27 23:13:48,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:13:48,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 23:13:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:13:48,639 INFO L225 Difference]: With dead ends: 2622 [2019-12-27 23:13:48,640 INFO L226 Difference]: Without dead ends: 2622 [2019-12-27 23:13:48,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:13:48,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2019-12-27 23:13:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 1652. [2019-12-27 23:13:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-12-27 23:13:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 3682 transitions. [2019-12-27 23:13:48,692 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 3682 transitions. Word has length 10 [2019-12-27 23:13:48,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:13:48,692 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 3682 transitions. [2019-12-27 23:13:48,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:13:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 3682 transitions. [2019-12-27 23:13:48,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:13:48,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:13:48,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:13:48,701 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-27 23:13:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:13:48,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2001156157, now seen corresponding path program 1 times [2019-12-27 23:13:48,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:13:48,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599523312] [2019-12-27 23:13:48,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:13:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:13:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:13:48,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599523312] [2019-12-27 23:13:48,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:13:48,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 23:13:48,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1204327193] [2019-12-27 23:13:48,865 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:13:48,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:13:48,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 38 transitions. [2019-12-27 23:13:48,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:13:48,879 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:13:48,882 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:13:48,882 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:13:48,882 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:18 [2019-12-27 23:13:49,166 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:13:49,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:13:49,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:13:49,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:13:49,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:13:49,168 INFO L87 Difference]: Start difference. First operand 1652 states and 3682 transitions. Second operand 17 states. [2019-12-27 23:13:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:13:54,795 INFO L93 Difference]: Finished difference Result 2171 states and 4725 transitions. [2019-12-27 23:13:54,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 23:13:54,796 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-12-27 23:13:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:13:54,808 INFO L225 Difference]: With dead ends: 2171 [2019-12-27 23:13:54,808 INFO L226 Difference]: Without dead ends: 2171 [2019-12-27 23:13:54,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 23:13:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2019-12-27 23:13:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1661. [2019-12-27 23:13:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1661 states. [2019-12-27 23:13:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 3702 transitions. [2019-12-27 23:13:54,855 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 3702 transitions. Word has length 14 [2019-12-27 23:13:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:13:54,855 INFO L462 AbstractCegarLoop]: Abstraction has 1661 states and 3702 transitions. [2019-12-27 23:13:54,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:13:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 3702 transitions. [2019-12-27 23:13:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:13:54,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:13:54,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:13:54,857 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-27 23:13:54,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:13:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2063395534, now seen corresponding path program 1 times [2019-12-27 23:13:54,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:13:54,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244006445] [2019-12-27 23:13:54,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:13:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:13:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:13:55,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244006445] [2019-12-27 23:13:55,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:13:55,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:13:55,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [733445166] [2019-12-27 23:13:55,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:13:55,017 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:13:55,021 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 23:13:55,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:13:55,021 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:13:55,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:13:55,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:13:55,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:13:55,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:13:55,023 INFO L87 Difference]: Start difference. First operand 1661 states and 3702 transitions. Second operand 8 states. [2019-12-27 23:13:56,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:13:56,118 INFO L93 Difference]: Finished difference Result 2488 states and 5511 transitions. [2019-12-27 23:13:56,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:13:56,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-27 23:13:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:13:56,132 INFO L225 Difference]: With dead ends: 2488 [2019-12-27 23:13:56,132 INFO L226 Difference]: Without dead ends: 2402 [2019-12-27 23:13:56,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:13:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2019-12-27 23:13:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1819. [2019-12-27 23:13:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2019-12-27 23:13:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 4102 transitions. [2019-12-27 23:13:56,176 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 4102 transitions. Word has length 14 [2019-12-27 23:13:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:13:56,176 INFO L462 AbstractCegarLoop]: Abstraction has 1819 states and 4102 transitions. [2019-12-27 23:13:56,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:13:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 4102 transitions. [2019-12-27 23:13:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:13:56,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:13:56,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:13:56,178 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-27 23:13:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:13:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash -722204445, now seen corresponding path program 1 times [2019-12-27 23:13:56,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:13:56,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183669067] [2019-12-27 23:13:56,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:13:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:13:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:13:56,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183669067] [2019-12-27 23:13:56,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:13:56,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:13:56,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281419603] [2019-12-27 23:13:56,350 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:13:56,352 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:13:56,359 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 63 transitions. [2019-12-27 23:13:56,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:13:56,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:13:56,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 23:13:56,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:13:56,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 23:13:56,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:13:56,777 INFO L87 Difference]: Start difference. First operand 1819 states and 4102 transitions. Second operand 20 states. [2019-12-27 23:13:57,993 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-12-27 23:13:58,254 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-12-27 23:13:58,500 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 39 [2019-12-27 23:13:58,673 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-12-27 23:13:58,941 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-12-27 23:13:59,302 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2019-12-27 23:13:59,874 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2019-12-27 23:14:00,337 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2019-12-27 23:14:00,806 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 49 [2019-12-27 23:14:00,982 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-12-27 23:14:01,381 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 106 [2019-12-27 23:14:01,554 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-12-27 23:14:02,041 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-12-27 23:14:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:06,943 INFO L93 Difference]: Finished difference Result 2552 states and 5611 transitions. [2019-12-27 23:14:06,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 23:14:06,944 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 15 [2019-12-27 23:14:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:06,960 INFO L225 Difference]: With dead ends: 2552 [2019-12-27 23:14:06,961 INFO L226 Difference]: Without dead ends: 2552 [2019-12-27 23:14:06,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=532, Invalid=1630, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 23:14:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2019-12-27 23:14:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1944. [2019-12-27 23:14:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1944 states. [2019-12-27 23:14:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 4393 transitions. [2019-12-27 23:14:07,020 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 4393 transitions. Word has length 15 [2019-12-27 23:14:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:07,022 INFO L462 AbstractCegarLoop]: Abstraction has 1944 states and 4393 transitions. [2019-12-27 23:14:07,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 23:14:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 4393 transitions. [2019-12-27 23:14:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:14:07,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:07,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:07,024 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-27 23:14:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:07,024 INFO L82 PathProgramCache]: Analyzing trace with hash -858033359, now seen corresponding path program 2 times [2019-12-27 23:14:07,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:07,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993934331] [2019-12-27 23:14:07,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:07,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993934331] [2019-12-27 23:14:07,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:07,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:14:07,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115692543] [2019-12-27 23:14:07,424 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:07,427 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:07,432 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 51 transitions. [2019-12-27 23:14:07,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:08,127 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:14:08,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 23:14:08,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:08,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 23:14:08,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:14:08,129 INFO L87 Difference]: Start difference. First operand 1944 states and 4393 transitions. Second operand 28 states. [2019-12-27 23:14:09,269 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2019-12-27 23:14:09,622 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 68 [2019-12-27 23:14:09,850 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 73 [2019-12-27 23:14:10,022 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 52 [2019-12-27 23:14:10,444 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 47 [2019-12-27 23:14:10,734 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 85 [2019-12-27 23:14:10,980 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 75 [2019-12-27 23:14:11,542 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 56 [2019-12-27 23:14:11,856 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 83 [2019-12-27 23:14:12,152 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 86 [2019-12-27 23:14:12,597 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 48 [2019-12-27 23:14:12,828 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 41 [2019-12-27 23:14:13,064 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 54 [2019-12-27 23:14:13,351 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 78 [2019-12-27 23:14:13,621 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 50 [2019-12-27 23:14:14,227 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 56 [2019-12-27 23:14:14,561 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 89 [2019-12-27 23:14:14,842 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 46 [2019-12-27 23:14:15,412 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 59 [2019-12-27 23:14:15,791 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 50 [2019-12-27 23:14:16,788 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 53 [2019-12-27 23:14:17,415 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 49 [2019-12-27 23:14:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:24,922 INFO L93 Difference]: Finished difference Result 2894 states and 6319 transitions. [2019-12-27 23:14:24,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 23:14:24,923 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 15 [2019-12-27 23:14:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:24,939 INFO L225 Difference]: With dead ends: 2894 [2019-12-27 23:14:24,939 INFO L226 Difference]: Without dead ends: 2894 [2019-12-27 23:14:24,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=998, Invalid=4404, Unknown=0, NotChecked=0, Total=5402 [2019-12-27 23:14:24,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2019-12-27 23:14:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1968. [2019-12-27 23:14:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1968 states. [2019-12-27 23:14:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 4449 transitions. [2019-12-27 23:14:24,990 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 4449 transitions. Word has length 15 [2019-12-27 23:14:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:24,990 INFO L462 AbstractCegarLoop]: Abstraction has 1968 states and 4449 transitions. [2019-12-27 23:14:24,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 23:14:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 4449 transitions. [2019-12-27 23:14:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:14:24,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:24,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:24,992 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-27 23:14:24,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:24,992 INFO L82 PathProgramCache]: Analyzing trace with hash 292344217, now seen corresponding path program 3 times [2019-12-27 23:14:24,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:24,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365061490] [2019-12-27 23:14:24,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:25,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365061490] [2019-12-27 23:14:25,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:25,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 23:14:25,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1972018040] [2019-12-27 23:14:25,255 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:25,256 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:25,260 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 43 transitions. [2019-12-27 23:14:25,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:25,263 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_311|], 2=[|v_#memory_$Pointer$.base_311|]} [2019-12-27 23:14:25,265 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:14:25,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:14:25,274 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-27 23:14:25,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:14:25,277 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:14:25,277 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:16 [2019-12-27 23:14:25,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 23:14:25,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 23:14:25,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:25,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 23:14:25,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:14:25,707 INFO L87 Difference]: Start difference. First operand 1968 states and 4449 transitions. Second operand 20 states. [2019-12-27 23:14:26,227 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-12-27 23:14:26,581 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 65 [2019-12-27 23:14:26,927 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-27 23:14:27,128 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 57 [2019-12-27 23:14:27,460 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 107 [2019-12-27 23:14:27,684 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 67 [2019-12-27 23:14:28,204 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 59 [2019-12-27 23:14:28,585 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 113 [2019-12-27 23:14:28,891 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 109 [2019-12-27 23:14:29,702 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 115 [2019-12-27 23:14:29,944 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 70 [2019-12-27 23:14:30,266 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 74 [2019-12-27 23:14:30,485 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 55 [2019-12-27 23:14:30,752 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 69 [2019-12-27 23:14:31,112 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 112 [2019-12-27 23:14:31,429 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 76 [2019-12-27 23:14:31,680 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 70 [2019-12-27 23:14:31,949 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 57 [2019-12-27 23:14:32,211 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 72 [2019-12-27 23:14:32,665 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 118 [2019-12-27 23:14:33,050 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 72 [2019-12-27 23:14:33,809 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 75 [2019-12-27 23:14:34,256 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 62 [2019-12-27 23:14:35,435 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 79 [2019-12-27 23:14:35,674 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 60 [2019-12-27 23:14:36,236 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 75 [2019-12-27 23:14:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:41,583 INFO L93 Difference]: Finished difference Result 2658 states and 5863 transitions. [2019-12-27 23:14:41,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 23:14:41,584 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 15 [2019-12-27 23:14:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:41,595 INFO L225 Difference]: With dead ends: 2658 [2019-12-27 23:14:41,595 INFO L226 Difference]: Without dead ends: 2658 [2019-12-27 23:14:41,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=877, Invalid=2663, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 23:14:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2019-12-27 23:14:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 1972. [2019-12-27 23:14:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1972 states. [2019-12-27 23:14:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 4457 transitions. [2019-12-27 23:14:41,637 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 4457 transitions. Word has length 15 [2019-12-27 23:14:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:41,638 INFO L462 AbstractCegarLoop]: Abstraction has 1972 states and 4457 transitions. [2019-12-27 23:14:41,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 23:14:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 4457 transitions. [2019-12-27 23:14:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:14:41,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:41,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:41,639 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-27 23:14:41,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:41,640 INFO L82 PathProgramCache]: Analyzing trace with hash 136143593, now seen corresponding path program 1 times [2019-12-27 23:14:41,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:41,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985808022] [2019-12-27 23:14:41,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:41,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985808022] [2019-12-27 23:14:41,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:41,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:14:41,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1284147177] [2019-12-27 23:14:41,836 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:41,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:41,842 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 43 transitions. [2019-12-27 23:14:41,842 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:41,848 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:14:41,849 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:14:41,850 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:14:41,850 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:16 [2019-12-27 23:14:41,866 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:14:41,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:14:41,868 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:14:41,868 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:21 [2019-12-27 23:14:42,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:14:42,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:14:42,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:42,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:14:42,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:14:42,086 INFO L87 Difference]: Start difference. First operand 1972 states and 4457 transitions. Second operand 19 states. [2019-12-27 23:14:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:48,113 INFO L93 Difference]: Finished difference Result 2721 states and 5981 transitions. [2019-12-27 23:14:48,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:14:48,113 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-12-27 23:14:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:48,119 INFO L225 Difference]: With dead ends: 2721 [2019-12-27 23:14:48,120 INFO L226 Difference]: Without dead ends: 2721 [2019-12-27 23:14:48,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=394, Invalid=1166, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 23:14:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2019-12-27 23:14:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2012. [2019-12-27 23:14:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-12-27 23:14:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 4547 transitions. [2019-12-27 23:14:48,161 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 4547 transitions. Word has length 15 [2019-12-27 23:14:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:48,162 INFO L462 AbstractCegarLoop]: Abstraction has 2012 states and 4547 transitions. [2019-12-27 23:14:48,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:14:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 4547 transitions. [2019-12-27 23:14:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 23:14:48,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:48,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:48,163 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-27 23:14:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash -137702070, now seen corresponding path program 1 times [2019-12-27 23:14:48,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:48,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534974654] [2019-12-27 23:14:48,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:48,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534974654] [2019-12-27 23:14:48,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:48,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:14:48,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1033848018] [2019-12-27 23:14:48,310 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:48,312 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:48,317 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 48 transitions. [2019-12-27 23:14:48,317 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:48,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:14:48,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:14:48,323 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:14:48,323 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:21 [2019-12-27 23:14:48,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:14:48,373 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:14:48,373 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:14:48,374 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:26 [2019-12-27 23:14:48,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:14:48,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 23:14:48,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:48,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 23:14:48,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:14:48,606 INFO L87 Difference]: Start difference. First operand 2012 states and 4547 transitions. Second operand 21 states. [2019-12-27 23:14:50,729 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-12-27 23:14:51,427 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-12-27 23:14:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:57,281 INFO L93 Difference]: Finished difference Result 2826 states and 6196 transitions. [2019-12-27 23:14:57,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:14:57,282 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 16 [2019-12-27 23:14:57,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:57,291 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 23:14:57,291 INFO L226 Difference]: Without dead ends: 2826 [2019-12-27 23:14:57,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=427, Invalid=1295, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 23:14:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2019-12-27 23:14:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2014. [2019-12-27 23:14:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-27 23:14:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 4553 transitions. [2019-12-27 23:14:57,331 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 4553 transitions. Word has length 16 [2019-12-27 23:14:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:57,332 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 4553 transitions. [2019-12-27 23:14:57,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 23:14:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 4553 transitions. [2019-12-27 23:14:57,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:14:57,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:57,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:57,334 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-27 23:14:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:57,334 INFO L82 PathProgramCache]: Analyzing trace with hash -352976365, now seen corresponding path program 1 times [2019-12-27 23:14:57,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:57,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662689211] [2019-12-27 23:14:57,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:57,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662689211] [2019-12-27 23:14:57,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:57,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 23:14:57,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [636836227] [2019-12-27 23:14:57,770 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:57,772 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:57,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 53 transitions. [2019-12-27 23:14:57,779 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:58,436 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:14:58,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 23:14:58,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:58,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 23:14:58,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:14:58,438 INFO L87 Difference]: Start difference. First operand 2014 states and 4553 transitions. Second operand 30 states. [2019-12-27 23:14:59,659 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2019-12-27 23:14:59,842 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 49 [2019-12-27 23:15:00,036 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 65 [2019-12-27 23:15:00,290 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 74 [2019-12-27 23:15:00,472 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 49 [2019-12-27 23:15:00,968 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 48 [2019-12-27 23:15:01,268 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 87 [2019-12-27 23:15:01,534 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 71 [2019-12-27 23:15:02,145 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 60 [2019-12-27 23:15:02,491 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 84 [2019-12-27 23:15:02,805 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 84 [2019-12-27 23:15:03,008 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 52 [2019-12-27 23:15:03,298 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 53 [2019-12-27 23:15:03,536 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 45 [2019-12-27 23:15:03,777 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 55 [2019-12-27 23:15:04,064 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 74 [2019-12-27 23:15:04,353 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 54 [2019-12-27 23:15:04,575 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 52 [2019-12-27 23:15:04,830 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 46 [2019-12-27 23:15:05,041 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 56 [2019-12-27 23:15:05,380 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 87 [2019-12-27 23:15:05,690 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 53 [2019-12-27 23:15:06,276 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 59 [2019-12-27 23:15:06,756 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 51 [2019-12-27 23:15:08,107 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 57 [2019-12-27 23:15:08,329 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 49 [2019-12-27 23:15:08,916 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 56 [2019-12-27 23:15:15,129 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-12-27 23:15:15,305 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-12-27 23:15:16,348 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-12-27 23:15:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:15:18,213 INFO L93 Difference]: Finished difference Result 3607 states and 7941 transitions. [2019-12-27 23:15:18,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-27 23:15:18,214 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 17 [2019-12-27 23:15:18,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:15:18,223 INFO L225 Difference]: With dead ends: 3607 [2019-12-27 23:15:18,223 INFO L226 Difference]: Without dead ends: 3607 [2019-12-27 23:15:18,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1198, Invalid=6284, Unknown=0, NotChecked=0, Total=7482 [2019-12-27 23:15:18,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-27 23:15:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 2162. [2019-12-27 23:15:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2162 states. [2019-12-27 23:15:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 4934 transitions. [2019-12-27 23:15:18,272 INFO L78 Accepts]: Start accepts. Automaton has 2162 states and 4934 transitions. Word has length 17 [2019-12-27 23:15:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:15:18,274 INFO L462 AbstractCegarLoop]: Abstraction has 2162 states and 4934 transitions. [2019-12-27 23:15:18,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 23:15:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 4934 transitions. [2019-12-27 23:15:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:15:18,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:15:18,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:15:18,276 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-27 23:15:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:15:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash 471458529, now seen corresponding path program 2 times [2019-12-27 23:15:18,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:15:18,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191205498] [2019-12-27 23:15:18,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:15:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:15:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:15:18,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191205498] [2019-12-27 23:15:18,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:15:18,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 23:15:18,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [810082560] [2019-12-27 23:15:18,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:15:18,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:15:18,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 53 transitions. [2019-12-27 23:15:18,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:15:19,223 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:15:19,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 23:15:19,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:15:19,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 23:15:19,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:15:19,225 INFO L87 Difference]: Start difference. First operand 2162 states and 4934 transitions. Second operand 29 states. [2019-12-27 23:15:20,095 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 47 [2019-12-27 23:15:20,416 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2019-12-27 23:15:20,588 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 50 [2019-12-27 23:15:20,828 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 60 [2019-12-27 23:15:20,992 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 49 [2019-12-27 23:15:21,475 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 53 [2019-12-27 23:15:21,786 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 68 [2019-12-27 23:15:22,002 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 62 [2019-12-27 23:15:22,706 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 70 [2019-12-27 23:15:22,887 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 52 [2019-12-27 23:15:23,163 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 52 [2019-12-27 23:15:23,370 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 44 [2019-12-27 23:15:23,579 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 52 [2019-12-27 23:15:23,836 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 65 [2019-12-27 23:15:24,106 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 54 [2019-12-27 23:15:24,276 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 50 [2019-12-27 23:15:24,526 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 46 [2019-12-27 23:15:24,723 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 54 [2019-12-27 23:15:25,066 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 73 [2019-12-27 23:15:25,348 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 52 [2019-12-27 23:15:25,964 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 57 [2019-12-27 23:15:26,458 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 56 [2019-12-27 23:15:27,968 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 57 [2019-12-27 23:15:28,234 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 49 [2019-12-27 23:15:28,769 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 55 [2019-12-27 23:15:35,000 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-12-27 23:15:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:15:36,830 INFO L93 Difference]: Finished difference Result 3848 states and 8507 transitions. [2019-12-27 23:15:36,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 23:15:36,830 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 17 [2019-12-27 23:15:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:15:36,839 INFO L225 Difference]: With dead ends: 3848 [2019-12-27 23:15:36,839 INFO L226 Difference]: Without dead ends: 3848 [2019-12-27 23:15:36,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1853 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1290, Invalid=6192, Unknown=0, NotChecked=0, Total=7482 [2019-12-27 23:15:36,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2019-12-27 23:15:36,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 2153. [2019-12-27 23:15:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2153 states. [2019-12-27 23:15:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 4913 transitions. [2019-12-27 23:15:36,889 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 4913 transitions. Word has length 17 [2019-12-27 23:15:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:15:36,890 INFO L462 AbstractCegarLoop]: Abstraction has 2153 states and 4913 transitions. [2019-12-27 23:15:36,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 23:15:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 4913 transitions. [2019-12-27 23:15:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:15:36,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:15:36,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:15:36,892 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-27 23:15:36,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:15:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1246355441, now seen corresponding path program 1 times [2019-12-27 23:15:36,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:15:36,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118036541] [2019-12-27 23:15:36,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:15:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:15:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:15:37,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118036541] [2019-12-27 23:15:37,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:15:37,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:15:37,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1764361387] [2019-12-27 23:15:37,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:15:37,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:15:37,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 23:15:37,037 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:15:37,037 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:15:37,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:15:37,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:15:37,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:15:37,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:15:37,038 INFO L87 Difference]: Start difference. First operand 2153 states and 4913 transitions. Second operand 7 states. [2019-12-27 23:15:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:15:37,922 INFO L93 Difference]: Finished difference Result 2398 states and 5418 transitions. [2019-12-27 23:15:37,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:15:37,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-27 23:15:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:15:37,927 INFO L225 Difference]: With dead ends: 2398 [2019-12-27 23:15:37,927 INFO L226 Difference]: Without dead ends: 2398 [2019-12-27 23:15:37,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:15:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2019-12-27 23:15:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2234. [2019-12-27 23:15:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-12-27 23:15:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 5073 transitions. [2019-12-27 23:15:37,965 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 5073 transitions. Word has length 17 [2019-12-27 23:15:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:15:37,965 INFO L462 AbstractCegarLoop]: Abstraction has 2234 states and 5073 transitions. [2019-12-27 23:15:37,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:15:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 5073 transitions. [2019-12-27 23:15:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:15:37,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:15:37,967 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-27 23:15:37,967 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-27 23:15:37,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:15:37,967 INFO L82 PathProgramCache]: Analyzing trace with hash 813210155, now seen corresponding path program 1 times [2019-12-27 23:15:37,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:15:37,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142822229] [2019-12-27 23:15:37,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:15:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:15:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:15:38,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142822229] [2019-12-27 23:15:38,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:15:38,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 23:15:38,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1605839901] [2019-12-27 23:15:38,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:15:38,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:15:38,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 58 transitions. [2019-12-27 23:15:38,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:15:38,257 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_316|], 2=[|v_#memory_$Pointer$.base_316|]} [2019-12-27 23:15:38,259 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:15:38,264 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:15:38,266 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-27 23:15:38,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:15:38,269 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:15:38,269 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:16 [2019-12-27 23:15:38,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:15:38,324 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:15:38,324 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:15:38,324 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:69 [2019-12-27 23:15:38,358 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:15:38,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:15:38,362 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:15:38,362 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:103, output treesize:86 [2019-12-27 23:15:38,397 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:15:38,401 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:15:38,401 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:15:38,401 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:134, output treesize:113 [2019-12-27 23:15:38,772 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 23:15:38,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 23:15:38,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:15:38,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 23:15:38,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:15:38,774 INFO L87 Difference]: Start difference. First operand 2234 states and 5073 transitions. Second operand 25 states. [2019-12-27 23:15:40,791 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-12-27 23:15:41,461 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2019-12-27 23:15:41,682 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-12-27 23:15:42,301 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 99 [2019-12-27 23:15:42,841 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 116 [2019-12-27 23:15:43,185 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-12-27 23:15:43,600 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 128 [2019-12-27 23:15:43,875 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 118 [2019-12-27 23:15:44,118 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 102 [2019-12-27 23:15:44,736 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 130 [2019-12-27 23:15:45,430 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 121 [2019-12-27 23:15:46,164 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 133 [2019-12-27 23:15:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:15:53,386 INFO L93 Difference]: Finished difference Result 2860 states and 6307 transitions. [2019-12-27 23:15:53,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 23:15:53,387 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 18 [2019-12-27 23:15:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:15:53,391 INFO L225 Difference]: With dead ends: 2860 [2019-12-27 23:15:53,391 INFO L226 Difference]: Without dead ends: 2860 [2019-12-27 23:15:53,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=784, Invalid=2296, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 23:15:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2019-12-27 23:15:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2273. [2019-12-27 23:15:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2273 states. [2019-12-27 23:15:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 5163 transitions. [2019-12-27 23:15:53,429 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 5163 transitions. Word has length 18 [2019-12-27 23:15:53,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:15:53,430 INFO L462 AbstractCegarLoop]: Abstraction has 2273 states and 5163 transitions. [2019-12-27 23:15:53,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 23:15:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 5163 transitions. [2019-12-27 23:15:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:15:53,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:15:53,432 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-27 23:15:53,432 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-27 23:15:53,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:15:53,432 INFO L82 PathProgramCache]: Analyzing trace with hash 489287396, now seen corresponding path program 1 times [2019-12-27 23:15:53,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:15:53,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242816175] [2019-12-27 23:15:53,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:15:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:15:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:15:53,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242816175] [2019-12-27 23:15:53,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:15:53,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 23:15:53,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [401161412] [2019-12-27 23:15:53,927 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:15:53,932 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:15:53,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 18 transitions. [2019-12-27 23:15:53,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:15:53,937 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:15:53,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:15:53,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:15:53,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:15:53,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:15:53,938 INFO L87 Difference]: Start difference. First operand 2273 states and 5163 transitions. Second operand 15 states. [2019-12-27 23:15:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:15:56,869 INFO L93 Difference]: Finished difference Result 3593 states and 8068 transitions. [2019-12-27 23:15:56,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:15:56,870 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 23:15:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:15:56,874 INFO L225 Difference]: With dead ends: 3593 [2019-12-27 23:15:56,874 INFO L226 Difference]: Without dead ends: 3593 [2019-12-27 23:15:56,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:15:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2019-12-27 23:15:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 2270. [2019-12-27 23:15:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 23:15:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 5148 transitions. [2019-12-27 23:15:56,908 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 5148 transitions. Word has length 18 [2019-12-27 23:15:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:15:56,909 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 5148 transitions. [2019-12-27 23:15:56,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:15:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 5148 transitions. [2019-12-27 23:15:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 23:15:56,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:15:56,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:15:56,911 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-27 23:15:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:15:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1521685972, now seen corresponding path program 1 times [2019-12-27 23:15:56,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:15:56,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761963360] [2019-12-27 23:15:56,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:15:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:15:58,263 WARN L192 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 92 [2019-12-27 23:15:58,752 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2019-12-27 23:15:59,227 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 67 [2019-12-27 23:15:59,590 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 45 [2019-12-27 23:15:59,911 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 44 [2019-12-27 23:16:00,098 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 33 [2019-12-27 23:16:00,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-27 23:16:00,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761963360] [2019-12-27 23:16:00,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:16:00,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 23:16:00,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1451858704] [2019-12-27 23:16:00,179 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:16:00,182 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:16:00,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 60 transitions. [2019-12-27 23:16:00,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:16:00,591 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 23:16:01,132 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-12-27 23:16:01,658 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-27 23:16:01,820 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:16:01,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 23:16:01,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:16:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 23:16:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1077, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 23:16:01,821 INFO L87 Difference]: Start difference. First operand 2270 states and 5148 transitions. Second operand 35 states. [2019-12-27 23:16:03,287 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-12-27 23:16:03,503 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 50 [2019-12-27 23:16:03,727 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-12-27 23:16:04,037 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 81 [2019-12-27 23:16:04,805 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 54 [2019-12-27 23:16:05,171 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 94 [2019-12-27 23:16:05,476 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 85 [2019-12-27 23:16:06,306 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 72 [2019-12-27 23:16:06,619 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 63 [2019-12-27 23:16:07,047 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-12-27 23:16:07,413 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 98 [2019-12-27 23:16:07,656 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2019-12-27 23:16:08,025 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 44 [2019-12-27 23:16:08,552 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2019-12-27 23:16:08,942 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 88 [2019-12-27 23:16:09,302 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 48 [2019-12-27 23:16:09,901 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 70 [2019-12-27 23:16:10,427 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 60 [2019-12-27 23:16:10,870 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 98 [2019-12-27 23:16:11,771 WARN L192 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 74 [2019-12-27 23:16:12,676 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 63 [2019-12-27 23:16:13,302 WARN L192 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2019-12-27 23:16:13,734 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 57 [2019-12-27 23:16:14,739 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-12-27 23:16:15,978 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 51 [2019-12-27 23:16:16,691 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-12-27 23:16:17,735 WARN L192 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 77 [2019-12-27 23:16:18,348 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-12-27 23:16:18,540 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-12-27 23:16:20,111 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-12-27 23:16:20,748 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2019-12-27 23:16:21,376 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-27 23:16:21,521 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-27 23:16:21,693 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-12-27 23:16:23,279 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-12-27 23:16:24,460 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 23:16:24,704 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-12-27 23:16:27,755 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-12-27 23:16:34,290 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 63 [2019-12-27 23:16:35,010 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-27 23:16:37,238 WARN L192 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2019-12-27 23:16:37,876 WARN L192 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 98 [2019-12-27 23:16:40,194 WARN L192 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 82 [2019-12-27 23:16:40,885 WARN L192 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 86 [2019-12-27 23:16:44,423 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-27 23:16:44,876 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 23:16:44,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:16:44,889 INFO L93 Difference]: Finished difference Result 4165 states and 9176 transitions. [2019-12-27 23:16:44,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-12-27 23:16:44,889 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 20 [2019-12-27 23:16:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:16:44,894 INFO L225 Difference]: With dead ends: 4165 [2019-12-27 23:16:44,895 INFO L226 Difference]: Without dead ends: 4165 [2019-12-27 23:16:44,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3787 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=1414, Invalid=11018, Unknown=0, NotChecked=0, Total=12432 [2019-12-27 23:16:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4165 states. [2019-12-27 23:16:44,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4165 to 2361. [2019-12-27 23:16:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2361 states. [2019-12-27 23:16:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 5373 transitions. [2019-12-27 23:16:44,936 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 5373 transitions. Word has length 20 [2019-12-27 23:16:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:16:44,936 INFO L462 AbstractCegarLoop]: Abstraction has 2361 states and 5373 transitions. [2019-12-27 23:16:44,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 23:16:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 5373 transitions. [2019-12-27 23:16:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 23:16:44,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:16:44,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:16:44,939 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-27 23:16:44,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:16:44,940 INFO L82 PathProgramCache]: Analyzing trace with hash 595242654, now seen corresponding path program 2 times [2019-12-27 23:16:44,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:16:44,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976563857] [2019-12-27 23:16:44,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:16:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:16:45,854 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 76 [2019-12-27 23:16:46,044 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2019-12-27 23:16:46,228 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2019-12-27 23:16:46,398 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-12-27 23:16:46,685 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-12-27 23:16:46,865 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-12-27 23:16:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:16:47,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976563857] [2019-12-27 23:16:47,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:16:47,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 23:16:47,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [770338494] [2019-12-27 23:16:47,104 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:16:47,107 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:16:47,138 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 72 transitions. [2019-12-27 23:16:47,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:16:47,503 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2019-12-27 23:16:49,227 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 23:16:49,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-27 23:16:49,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:16:49,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-27 23:16:49,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1517, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 23:16:49,229 INFO L87 Difference]: Start difference. First operand 2361 states and 5373 transitions. Second operand 41 states. [2019-12-27 23:16:49,626 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-12-27 23:16:50,742 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-27 23:16:50,940 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 44 [2019-12-27 23:16:51,211 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 62 [2019-12-27 23:16:51,908 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 77 [2019-12-27 23:16:52,655 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 108 [2019-12-27 23:16:53,357 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 44 [2019-12-27 23:16:53,634 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-12-27 23:16:54,056 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 57 [2019-12-27 23:16:54,342 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 65 [2019-12-27 23:16:55,414 WARN L192 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 104 [2019-12-27 23:16:55,926 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 78 [2019-12-27 23:16:56,572 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 90 [2019-12-27 23:16:57,548 WARN L192 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 112 [2019-12-27 23:16:58,668 WARN L192 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 111 [2019-12-27 23:16:58,961 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-12-27 23:16:59,201 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-12-27 23:16:59,453 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 60 [2019-12-27 23:16:59,934 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-12-27 23:17:00,353 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-12-27 23:17:00,666 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 47 [2019-12-27 23:17:01,331 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-12-27 23:17:01,639 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2019-12-27 23:17:02,238 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 111 [2019-12-27 23:17:03,002 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 99 [2019-12-27 23:17:03,464 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 104 [2019-12-27 23:17:04,291 WARN L192 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 140 [2019-12-27 23:17:05,004 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 47 [2019-12-27 23:17:05,465 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 114 [2019-12-27 23:17:05,813 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-12-27 23:17:06,742 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-12-27 23:17:07,761 WARN L192 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 107 [2019-12-27 23:17:08,329 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 107 [2019-12-27 23:17:08,694 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-12-27 23:17:09,922 WARN L192 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 115 [2019-12-27 23:17:11,013 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-12-27 23:17:11,650 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2019-12-27 23:17:12,431 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-12-27 23:17:13,156 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-12-27 23:17:13,621 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 108 [2019-12-27 23:17:14,730 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-12-27 23:17:15,648 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 126 [2019-12-27 23:17:16,517 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 96 [2019-12-27 23:17:17,239 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 111 [2019-12-27 23:17:18,438 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 102 [2019-12-27 23:17:24,442 WARN L192 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 104 [2019-12-27 23:17:26,341 WARN L192 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 137 [2019-12-27 23:17:28,103 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 123 [2019-12-27 23:17:29,434 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-12-27 23:17:29,961 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 118 [2019-12-27 23:17:30,645 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-12-27 23:17:31,411 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 64 [2019-12-27 23:17:32,246 WARN L192 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 128 [2019-12-27 23:17:33,001 WARN L192 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 161 [2019-12-27 23:17:33,829 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2019-12-27 23:17:34,565 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 151 [2019-12-27 23:17:35,029 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 136 [2019-12-27 23:17:35,349 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-27 23:17:36,125 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 155 [2019-12-27 23:17:36,631 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 141 [2019-12-27 23:17:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:17:36,642 INFO L93 Difference]: Finished difference Result 4443 states and 9805 transitions. [2019-12-27 23:17:36,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-12-27 23:17:36,642 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 20 [2019-12-27 23:17:36,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:17:36,647 INFO L225 Difference]: With dead ends: 4443 [2019-12-27 23:17:36,647 INFO L226 Difference]: Without dead ends: 4443 [2019-12-27 23:17:36,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4018 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=1671, Invalid=12371, Unknown=0, NotChecked=0, Total=14042 [2019-12-27 23:17:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2019-12-27 23:17:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 2296. [2019-12-27 23:17:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2296 states. [2019-12-27 23:17:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 5208 transitions. [2019-12-27 23:17:36,693 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 5208 transitions. Word has length 20 [2019-12-27 23:17:36,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:17:36,693 INFO L462 AbstractCegarLoop]: Abstraction has 2296 states and 5208 transitions. [2019-12-27 23:17:36,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-27 23:17:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 5208 transitions. [2019-12-27 23:17:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 23:17:36,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:17:36,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:17:36,696 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-27 23:17:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:17:36,697 INFO L82 PathProgramCache]: Analyzing trace with hash -157923332, now seen corresponding path program 3 times [2019-12-27 23:17:36,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:17:36,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375820686] [2019-12-27 23:17:36,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:17:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:17:37,010 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-12-27 23:17:37,895 WARN L192 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 68 [2019-12-27 23:17:38,308 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-12-27 23:17:38,681 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-12-27 23:17:38,959 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-12-27 23:17:39,103 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-12-27 23:17:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:17:39,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375820686] [2019-12-27 23:17:39,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:17:39,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 23:17:39,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [445203466] [2019-12-27 23:17:39,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:17:39,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:17:39,264 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 68 transitions. [2019-12-27 23:17:39,264 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:17:39,275 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:39,277 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:39,277 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:17:39,277 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:18 [2019-12-27 23:17:39,368 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:39,372 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:39,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:39,394 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 23:17:39,394 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:259, output treesize:219 [2019-12-27 23:17:39,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:39,518 INFO L430 ElimStorePlain]: Different costs {7=[|v_#memory_$Pointer$.offset_322|], 15=[|v_#memory_$Pointer$.base_322|]} [2019-12-27 23:17:39,522 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-27 23:17:39,528 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-27 23:17:39,575 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:39,581 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:17:39,585 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:17:39,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:39,620 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-27 23:17:39,620 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:355, output treesize:579 [2019-12-27 23:17:40,517 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 23:17:41,026 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-12-27 23:17:41,548 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 88 [2019-12-27 23:17:41,953 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:17:41,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 23:17:41,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:17:41,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 23:17:41,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:17:41,954 INFO L87 Difference]: Start difference. First operand 2296 states and 5208 transitions. Second operand 29 states. [2019-12-27 23:17:43,464 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 77 [2019-12-27 23:17:43,965 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 87 [2019-12-27 23:17:44,499 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 86 [2019-12-27 23:17:46,161 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 91 [2019-12-27 23:17:46,675 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 80 [2019-12-27 23:17:47,696 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 86 Received shutdown request... [2019-12-27 23:17:47,929 WARN L209 SmtUtils]: Removed 2 from assertion stack [2019-12-27 23:17:47,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:17:47,930 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 23:17:47,934 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 23:17:47,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:17:47 BasicIcfg [2019-12-27 23:17:47,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:17:47,935 INFO L168 Benchmark]: Toolchain (without parser) took 258180.54 ms. Allocated memory was 146.3 MB in the beginning and 341.8 MB in the end (delta: 195.6 MB). Free memory was 100.9 MB in the beginning and 68.1 MB in the end (delta: 32.9 MB). Peak memory consumption was 228.4 MB. Max. memory is 7.1 GB. [2019-12-27 23:17:47,935 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 23:17:47,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 873.54 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 132.1 MB in the end (delta: -31.3 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:17:47,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.01 ms. Allocated memory is still 204.5 MB. Free memory was 132.1 MB in the beginning and 128.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:17:47,936 INFO L168 Benchmark]: Boogie Preprocessor took 58.44 ms. Allocated memory is still 204.5 MB. Free memory was 128.1 MB in the beginning and 124.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:17:47,937 INFO L168 Benchmark]: RCFGBuilder took 1193.35 ms. Allocated memory was 204.5 MB in the beginning and 236.5 MB in the end (delta: 32.0 MB). Free memory was 124.1 MB in the beginning and 151.6 MB in the end (delta: -27.4 MB). Peak memory consumption was 39.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:17:47,937 INFO L168 Benchmark]: TraceAbstraction took 255936.49 ms. Allocated memory was 236.5 MB in the beginning and 341.8 MB in the end (delta: 105.4 MB). Free memory was 151.6 MB in the beginning and 68.1 MB in the end (delta: 83.5 MB). Peak memory consumption was 188.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:17:47,939 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 was 121.4 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 873.54 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 132.1 MB in the end (delta: -31.3 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 114.01 ms. Allocated memory is still 204.5 MB. Free memory was 132.1 MB in the beginning and 128.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.44 ms. Allocated memory is still 204.5 MB. Free memory was 128.1 MB in the beginning and 124.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1193.35 ms. Allocated memory was 204.5 MB in the beginning and 236.5 MB in the end (delta: 32.0 MB). Free memory was 124.1 MB in the beginning and 151.6 MB in the end (delta: -27.4 MB). Peak memory consumption was 39.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255936.49 ms. Allocated memory was 236.5 MB in the beginning and 341.8 MB in the end (delta: 105.4 MB). Free memory was 151.6 MB in the beginning and 68.1 MB in the end (delta: 83.5 MB). Peak memory consumption was 188.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 14.4s, 426 ProgramPointsBefore, 107 ProgramPointsAfterwards, 455 TransitionsBefore, 122 TransitionsAfterwards, 31742 CoEnabledTransitionPairs, 8 FixpointIterations, 120 TrivialSequentialCompositions, 217 ConcurrentSequentialCompositions, 23 TrivialYvCompositions, 63 ConcurrentYvCompositions, 15 ChoiceCompositions, 16796 VarBasedMoverChecksPositive, 236 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 73353 CheckedPairsTotal, 423 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 (2296states) and FLOYD_HOARE automaton (currently 18 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 102 for 0ms.. - TimeoutResultAtElement [Line: 1087]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1087). Cancelled while BasicCegarLoop was constructing difference of abstraction (2296states) and FLOYD_HOARE automaton (currently 18 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 102 for 0ms.. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (2296states) and FLOYD_HOARE automaton (currently 18 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 102 for 0ms.. - TimeoutResultAtElement [Line: 1085]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1085). Cancelled while BasicCegarLoop was constructing difference of abstraction (2296states) and FLOYD_HOARE automaton (currently 18 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 102 for 0ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2296states) and FLOYD_HOARE automaton (currently 18 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 102 for 0ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2296states) and FLOYD_HOARE automaton (currently 18 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 102 for 0ms.. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (2296states) and FLOYD_HOARE automaton (currently 18 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 102 for 0ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2296states) and FLOYD_HOARE automaton (currently 18 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 102 for 0ms.. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (2296states) and FLOYD_HOARE automaton (currently 18 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 102 for 0ms.. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1065). Cancelled while BasicCegarLoop was constructing difference of abstraction (2296states) and FLOYD_HOARE automaton (currently 18 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 102 for 0ms.. - TimeoutResultAtElement [Line: 1089]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1089). Cancelled while BasicCegarLoop was constructing difference of abstraction (2296states) and FLOYD_HOARE automaton (currently 18 states, 29 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 102 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 423 locations, 11 error locations. Result: TIMEOUT, OverallTime: 255.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 217.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2344 SDtfs, 15699 SDslu, 14788 SDs, 0 SdLazy, 87608 SolverSat, 1345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 872 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 838 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15185 ImplicationChecksByTransitivity, 108.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2361occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 16521 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 128905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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