/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:06:53,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:06:53,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:06:53,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:06:53,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:06:53,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:06:53,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:06:53,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:06:53,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:06:53,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:06:53,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:06:53,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:06:53,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:06:53,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:06:53,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:06:53,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:06:53,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:06:53,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:06:53,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:06:53,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:06:53,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:06:53,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:06:53,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:06:53,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:06:53,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:06:53,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:06:53,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:06:53,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:06:53,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:06:53,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:06:53,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:06:53,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:06:53,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:06:53,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:06:53,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:06:53,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:06:53,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:06:53,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:06:53,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:06:53,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:06:53,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:06:53,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:06:53,554 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:06:53,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:06:53,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:06:53,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:06:53,557 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:06:53,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:06:53,558 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:06:53,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:06:53,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:06:53,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:06:53,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:06:53,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:06:53,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:06:53,560 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:06:53,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:06:53,561 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:06:53,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:06:53,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:06:53,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:06:53,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:06:53,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:06:53,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:06:53,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:06:53,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:06:53,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:06:53,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:06:53,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:06:53,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:06:53,563 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:06:53,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:06:53,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:06:53,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:06:53,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:06:53,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:06:53,870 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:06:53,871 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_pso.oepc.i [2019-12-26 23:06:53,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f192d9b9d/5c44b634ea7d463bbdea1386c4bf1b09/FLAGcc2f8992f [2019-12-26 23:06:54,538 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:06:54,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_pso.oepc.i [2019-12-26 23:06:54,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f192d9b9d/5c44b634ea7d463bbdea1386c4bf1b09/FLAGcc2f8992f [2019-12-26 23:06:54,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f192d9b9d/5c44b634ea7d463bbdea1386c4bf1b09 [2019-12-26 23:06:54,862 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:06:54,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:06:54,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:06:54,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:06:54,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:06:54,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:06:54" (1/1) ... [2019-12-26 23:06:54,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c21545b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:54, skipping insertion in model container [2019-12-26 23:06:54,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:06:54" (1/1) ... [2019-12-26 23:06:54,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:06:54,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:06:55,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:06:55,536 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:06:55,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:06:55,694 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:06:55,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:55 WrapperNode [2019-12-26 23:06:55,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:06:55,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:06:55,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:06:55,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:06:55,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:55" (1/1) ... [2019-12-26 23:06:55,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:55" (1/1) ... [2019-12-26 23:06:55,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:06:55,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:06:55,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:06:55,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:06:55,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:55" (1/1) ... [2019-12-26 23:06:55,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:55" (1/1) ... [2019-12-26 23:06:55,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:55" (1/1) ... [2019-12-26 23:06:55,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:55" (1/1) ... [2019-12-26 23:06:55,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:55" (1/1) ... [2019-12-26 23:06:55,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:55" (1/1) ... [2019-12-26 23:06:55,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:55" (1/1) ... [2019-12-26 23:06:55,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:06:55,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:06:55,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:06:55,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:06:55,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:55" (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-26 23:06:55,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:06:55,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:06:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:06:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:06:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:06:55,880 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:06:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:06:55,880 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:06:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:06:55,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:06:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:06:55,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:06:55,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:06:55,884 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:06:56,624 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:06:56,624 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:06:56,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:06:56 BoogieIcfgContainer [2019-12-26 23:06:56,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:06:56,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:06:56,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:06:56,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:06:56,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:06:54" (1/3) ... [2019-12-26 23:06:56,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b29cf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:06:56, skipping insertion in model container [2019-12-26 23:06:56,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:55" (2/3) ... [2019-12-26 23:06:56,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b29cf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:06:56, skipping insertion in model container [2019-12-26 23:06:56,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:06:56" (3/3) ... [2019-12-26 23:06:56,635 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_pso.oepc.i [2019-12-26 23:06:56,646 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:06:56,647 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:06:56,655 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:06:56,656 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:06:56,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,714 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,714 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,747 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,747 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,791 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,793 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,806 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,806 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,806 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,808 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,808 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:56,829 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:06:56,846 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:06:56,846 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:06:56,846 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:06:56,846 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:06:56,847 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:06:56,847 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:06:56,847 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:06:56,847 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:06:56,862 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-26 23:06:56,864 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 23:06:56,971 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 23:06:56,972 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:06:56,989 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:06:57,016 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 23:06:57,071 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 23:06:57,072 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:06:57,080 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:06:57,101 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 23:06:57,102 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:07:02,271 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 23:07:02,407 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 23:07:02,771 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-26 23:07:02,772 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-26 23:07:02,775 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-26 23:07:25,922 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-26 23:07:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-26 23:07:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:07:25,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:25,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:07:25,930 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:07:25,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:25,935 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-26 23:07:25,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:25,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206062310] [2019-12-26 23:07:25,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:26,144 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-26 23:07:26,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206062310] [2019-12-26 23:07:26,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:26,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:07:26,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506061601] [2019-12-26 23:07:26,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:07:26,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:26,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:07:26,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:07:26,170 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-26 23:07:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:28,911 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-26 23:07:28,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:07:28,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:07:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:29,577 INFO L225 Difference]: With dead ends: 125570 [2019-12-26 23:07:29,577 INFO L226 Difference]: Without dead ends: 111010 [2019-12-26 23:07:29,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-26 23:07:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-26 23:07:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-26 23:07:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-26 23:07:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-26 23:07:42,115 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-26 23:07:42,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:42,115 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-26 23:07:42,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:07:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-26 23:07:42,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:07:42,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:42,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:07:42,120 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:07:42,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-26 23:07:42,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:42,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333549704] [2019-12-26 23:07:42,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:42,212 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-26 23:07:42,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333549704] [2019-12-26 23:07:42,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:42,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:07:42,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81014504] [2019-12-26 23:07:42,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:07:42,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:42,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:07:42,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:07:42,215 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-26 23:07:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:47,699 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-26 23:07:47,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:07:47,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:07:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:48,414 INFO L225 Difference]: With dead ends: 172646 [2019-12-26 23:07:48,414 INFO L226 Difference]: Without dead ends: 172548 [2019-12-26 23:07:48,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:07:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-26 23:07:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-26 23:07:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-26 23:07:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-26 23:07:57,851 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-26 23:07:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:57,852 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-26 23:07:57,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:07:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-26 23:07:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:07:57,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:57,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:07:57,859 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:07:57,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:57,859 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-26 23:07:57,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:57,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064701221] [2019-12-26 23:07:57,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:57,931 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-26 23:07:57,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064701221] [2019-12-26 23:07:57,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:57,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:07:57,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93742183] [2019-12-26 23:07:57,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:07:57,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:57,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:07:57,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:07:57,933 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-26 23:08:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:02,722 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-26 23:08:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:08:02,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:08:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:02,792 INFO L225 Difference]: With dead ends: 34208 [2019-12-26 23:08:02,793 INFO L226 Difference]: Without dead ends: 34208 [2019-12-26 23:08:02,793 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-26 23:08:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-26 23:08:03,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-26 23:08:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-26 23:08:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-26 23:08:03,541 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-26 23:08:03,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:03,541 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-26 23:08:03,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:08:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-26 23:08:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:08:03,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:03,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:03,545 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:03,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:03,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-26 23:08:03,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:03,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336500815] [2019-12-26 23:08:03,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:03,613 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-26 23:08:03,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336500815] [2019-12-26 23:08:03,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:03,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:08:03,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723744867] [2019-12-26 23:08:03,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:08:03,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:03,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:08:03,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:08:03,615 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-26 23:08:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:03,842 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-26 23:08:03,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:08:03,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 23:08:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:03,939 INFO L225 Difference]: With dead ends: 51809 [2019-12-26 23:08:03,939 INFO L226 Difference]: Without dead ends: 51809 [2019-12-26 23:08:03,940 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-26 23:08:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-26 23:08:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-26 23:08:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-26 23:08:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-26 23:08:05,141 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-26 23:08:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:05,142 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-26 23:08:05,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:08:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-26 23:08:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:08:05,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:05,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:05,146 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-26 23:08:05,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:05,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250653331] [2019-12-26 23:08:05,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:05,245 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-26 23:08:05,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250653331] [2019-12-26 23:08:05,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:05,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:08:05,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076294506] [2019-12-26 23:08:05,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:08:05,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:05,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:08:05,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:08:05,249 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-26 23:08:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:05,827 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-26 23:08:05,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:08:05,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 23:08:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:05,918 INFO L225 Difference]: With dead ends: 53507 [2019-12-26 23:08:05,918 INFO L226 Difference]: Without dead ends: 53507 [2019-12-26 23:08:05,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:08:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-26 23:08:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-26 23:08:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-26 23:08:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-26 23:08:06,777 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-26 23:08:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:06,778 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-26 23:08:06,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:08:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-26 23:08:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:08:06,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:06,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:06,792 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:06,792 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-26 23:08:06,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:06,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576239055] [2019-12-26 23:08:06,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:07,291 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-26 23:08:07,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576239055] [2019-12-26 23:08:07,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:07,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:08:07,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910731398] [2019-12-26 23:08:07,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:08:07,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:07,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:08:07,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:08:07,294 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-26 23:08:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:08,306 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-26 23:08:08,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:08:08,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 23:08:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:08,420 INFO L225 Difference]: With dead ends: 66834 [2019-12-26 23:08:08,421 INFO L226 Difference]: Without dead ends: 66820 [2019-12-26 23:08:08,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:08:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-26 23:08:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-26 23:08:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-26 23:08:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-26 23:08:09,346 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-26 23:08:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:09,347 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-26 23:08:09,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:08:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-26 23:08:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:08:09,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:09,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:09,364 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:09,365 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-26 23:08:09,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:09,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063601911] [2019-12-26 23:08:09,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:09,461 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-26 23:08:09,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063601911] [2019-12-26 23:08:09,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:09,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:08:09,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818350632] [2019-12-26 23:08:09,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:08:09,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:09,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:08:09,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:08:09,463 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-26 23:08:09,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:09,550 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-26 23:08:09,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:08:09,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:08:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:09,575 INFO L225 Difference]: With dead ends: 18127 [2019-12-26 23:08:09,575 INFO L226 Difference]: Without dead ends: 18127 [2019-12-26 23:08:09,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:08:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-26 23:08:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-26 23:08:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-26 23:08:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-26 23:08:10,151 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-26 23:08:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:10,152 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-26 23:08:10,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:08:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-26 23:08:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 23:08:10,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:10,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:10,172 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:10,173 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-26 23:08:10,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:10,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227874787] [2019-12-26 23:08:10,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:10,271 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-26 23:08:10,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227874787] [2019-12-26 23:08:10,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:10,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:08:10,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880669994] [2019-12-26 23:08:10,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:08:10,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:08:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:08:10,274 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-26 23:08:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:10,888 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-26 23:08:10,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:08:10,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 23:08:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:10,927 INFO L225 Difference]: With dead ends: 25206 [2019-12-26 23:08:10,928 INFO L226 Difference]: Without dead ends: 25206 [2019-12-26 23:08:10,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:08:11,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-26 23:08:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-26 23:08:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-26 23:08:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-26 23:08:11,274 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-26 23:08:11,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:11,275 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-26 23:08:11,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:08:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-26 23:08:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 23:08:11,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:11,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:11,296 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:11,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-26 23:08:11,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:11,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528594960] [2019-12-26 23:08:11,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:11,401 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-26 23:08:11,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528594960] [2019-12-26 23:08:11,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:11,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:08:11,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414703870] [2019-12-26 23:08:11,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:08:11,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:11,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:08:11,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:08:11,403 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-26 23:08:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:12,638 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-26 23:08:12,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:08:12,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 23:08:12,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:12,678 INFO L225 Difference]: With dead ends: 28185 [2019-12-26 23:08:12,678 INFO L226 Difference]: Without dead ends: 28185 [2019-12-26 23:08:12,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:08:12,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-26 23:08:12,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-26 23:08:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-26 23:08:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-26 23:08:13,015 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-26 23:08:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:13,016 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-26 23:08:13,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:08:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-26 23:08:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 23:08:13,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:13,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:13,042 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:13,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:13,043 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-26 23:08:13,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:13,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413446109] [2019-12-26 23:08:13,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:13,113 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-26 23:08:13,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413446109] [2019-12-26 23:08:13,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:13,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:08:13,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351406228] [2019-12-26 23:08:13,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:08:13,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:13,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:08:13,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:08:13,115 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-26 23:08:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:13,190 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-26 23:08:13,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:08:13,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-26 23:08:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:13,224 INFO L225 Difference]: With dead ends: 18279 [2019-12-26 23:08:13,225 INFO L226 Difference]: Without dead ends: 18279 [2019-12-26 23:08:13,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:08:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-26 23:08:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-26 23:08:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-26 23:08:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-26 23:08:13,730 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-26 23:08:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:13,730 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-26 23:08:13,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:08:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-26 23:08:13,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:08:13,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:13,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:13,753 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:13,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-26 23:08:13,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:13,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274298239] [2019-12-26 23:08:13,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:13,869 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-26 23:08:13,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274298239] [2019-12-26 23:08:13,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:13,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:08:13,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047519205] [2019-12-26 23:08:13,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:08:13,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:13,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:08:13,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:08:13,873 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-26 23:08:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:14,329 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-26 23:08:14,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:08:14,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:08:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:14,389 INFO L225 Difference]: With dead ends: 48537 [2019-12-26 23:08:14,389 INFO L226 Difference]: Without dead ends: 38006 [2019-12-26 23:08:14,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:08:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-26 23:08:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-26 23:08:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-26 23:08:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-26 23:08:14,871 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-26 23:08:14,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:14,871 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-26 23:08:14,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:08:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-26 23:08:14,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:08:14,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:14,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:14,898 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:14,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:14,898 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-26 23:08:14,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:14,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411729827] [2019-12-26 23:08:14,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:15,002 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-26 23:08:15,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411729827] [2019-12-26 23:08:15,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:15,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:08:15,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123258175] [2019-12-26 23:08:15,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:08:15,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:15,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:08:15,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:08:15,004 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 7 states. [2019-12-26 23:08:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:15,618 INFO L93 Difference]: Finished difference Result 57554 states and 178145 transitions. [2019-12-26 23:08:15,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:08:15,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:08:15,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:15,678 INFO L225 Difference]: With dead ends: 57554 [2019-12-26 23:08:15,678 INFO L226 Difference]: Without dead ends: 41745 [2019-12-26 23:08:15,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:08:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-12-26 23:08:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 24743. [2019-12-26 23:08:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-26 23:08:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-26 23:08:16,505 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-26 23:08:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:16,506 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-26 23:08:16,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:08:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-26 23:08:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:08:16,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:16,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:16,539 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:16,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:16,539 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-26 23:08:16,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:16,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812722893] [2019-12-26 23:08:16,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:16,643 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-26 23:08:16,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812722893] [2019-12-26 23:08:16,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:16,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:08:16,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601371864] [2019-12-26 23:08:16,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:08:16,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:16,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:08:16,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:08:16,646 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 7 states. [2019-12-26 23:08:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:17,092 INFO L93 Difference]: Finished difference Result 51247 states and 161421 transitions. [2019-12-26 23:08:17,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:08:17,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:08:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:17,160 INFO L225 Difference]: With dead ends: 51247 [2019-12-26 23:08:17,160 INFO L226 Difference]: Without dead ends: 47407 [2019-12-26 23:08:17,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:08:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2019-12-26 23:08:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 24923. [2019-12-26 23:08:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-26 23:08:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-26 23:08:17,739 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-26 23:08:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:17,740 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-26 23:08:17,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:08:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-26 23:08:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:08:17,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:17,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:17,785 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-26 23:08:17,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:17,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016578322] [2019-12-26 23:08:17,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:17,906 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-26 23:08:17,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016578322] [2019-12-26 23:08:17,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:17,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:08:17,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184850957] [2019-12-26 23:08:17,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:08:17,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:17,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:08:17,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:08:17,909 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 3 states. [2019-12-26 23:08:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:18,005 INFO L93 Difference]: Finished difference Result 20919 states and 64986 transitions. [2019-12-26 23:08:18,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:08:18,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 23:08:18,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:18,037 INFO L225 Difference]: With dead ends: 20919 [2019-12-26 23:08:18,037 INFO L226 Difference]: Without dead ends: 20919 [2019-12-26 23:08:18,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:08:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-12-26 23:08:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 19827. [2019-12-26 23:08:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-26 23:08:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-26 23:08:18,342 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-26 23:08:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:18,342 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-26 23:08:18,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:08:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-26 23:08:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:08:18,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:18,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:18,365 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:18,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-26 23:08:18,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:18,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374176127] [2019-12-26 23:08:18,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:18,438 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-26 23:08:18,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374176127] [2019-12-26 23:08:18,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:18,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:08:18,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782684079] [2019-12-26 23:08:18,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:08:18,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:18,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:08:18,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:08:18,440 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-26 23:08:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:18,591 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-26 23:08:18,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:08:18,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:08:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:18,634 INFO L225 Difference]: With dead ends: 24197 [2019-12-26 23:08:18,634 INFO L226 Difference]: Without dead ends: 24197 [2019-12-26 23:08:18,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:08:18,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-26 23:08:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-26 23:08:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-26 23:08:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-26 23:08:19,281 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-26 23:08:19,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:19,281 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-26 23:08:19,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:08:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-26 23:08:19,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:19,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:19,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:19,306 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:19,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:19,306 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-26 23:08:19,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:19,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563593110] [2019-12-26 23:08:19,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:19,385 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-26 23:08:19,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563593110] [2019-12-26 23:08:19,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:19,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:08:19,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499951978] [2019-12-26 23:08:19,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:08:19,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:19,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:08:19,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:08:19,387 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-26 23:08:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:19,575 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-26 23:08:19,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:08:19,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 23:08:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:19,621 INFO L225 Difference]: With dead ends: 24621 [2019-12-26 23:08:19,622 INFO L226 Difference]: Without dead ends: 24621 [2019-12-26 23:08:19,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:08:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-26 23:08:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-26 23:08:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-26 23:08:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-26 23:08:20,030 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-26 23:08:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:20,031 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-26 23:08:20,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:08:20,031 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-26 23:08:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:20,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:20,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:20,056 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:20,056 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-26 23:08:20,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:20,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23560964] [2019-12-26 23:08:20,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:20,230 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-26 23:08:20,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23560964] [2019-12-26 23:08:20,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:20,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:08:20,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354815145] [2019-12-26 23:08:20,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:08:20,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:20,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:08:20,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:08:20,233 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 10 states. [2019-12-26 23:08:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:22,301 INFO L93 Difference]: Finished difference Result 38488 states and 118451 transitions. [2019-12-26 23:08:22,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:08:22,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 23:08:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:22,371 INFO L225 Difference]: With dead ends: 38488 [2019-12-26 23:08:22,371 INFO L226 Difference]: Without dead ends: 30672 [2019-12-26 23:08:22,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:08:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30672 states. [2019-12-26 23:08:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30672 to 21745. [2019-12-26 23:08:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21745 states. [2019-12-26 23:08:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21745 states to 21745 states and 67061 transitions. [2019-12-26 23:08:23,092 INFO L78 Accepts]: Start accepts. Automaton has 21745 states and 67061 transitions. Word has length 66 [2019-12-26 23:08:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:23,093 INFO L462 AbstractCegarLoop]: Abstraction has 21745 states and 67061 transitions. [2019-12-26 23:08:23,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:08:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 21745 states and 67061 transitions. [2019-12-26 23:08:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:23,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:23,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:23,124 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:23,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:23,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-26 23:08:23,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:23,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616412436] [2019-12-26 23:08:23,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:23,382 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-26 23:08:23,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616412436] [2019-12-26 23:08:23,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:23,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:08:23,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090516002] [2019-12-26 23:08:23,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:08:23,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:23,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:08:23,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:08:23,394 INFO L87 Difference]: Start difference. First operand 21745 states and 67061 transitions. Second operand 10 states. [2019-12-26 23:08:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:25,359 INFO L93 Difference]: Finished difference Result 37884 states and 115944 transitions. [2019-12-26 23:08:25,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:08:25,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 23:08:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:25,407 INFO L225 Difference]: With dead ends: 37884 [2019-12-26 23:08:25,408 INFO L226 Difference]: Without dead ends: 31924 [2019-12-26 23:08:25,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:08:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31924 states. [2019-12-26 23:08:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31924 to 22197. [2019-12-26 23:08:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22197 states. [2019-12-26 23:08:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22197 states to 22197 states and 68309 transitions. [2019-12-26 23:08:25,818 INFO L78 Accepts]: Start accepts. Automaton has 22197 states and 68309 transitions. Word has length 66 [2019-12-26 23:08:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:25,818 INFO L462 AbstractCegarLoop]: Abstraction has 22197 states and 68309 transitions. [2019-12-26 23:08:25,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:08:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 22197 states and 68309 transitions. [2019-12-26 23:08:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:25,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:25,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:25,842 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-26 23:08:25,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:25,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703774458] [2019-12-26 23:08:25,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:26,016 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-26 23:08:26,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703774458] [2019-12-26 23:08:26,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:26,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:08:26,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53067424] [2019-12-26 23:08:26,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:08:26,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:26,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:08:26,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:08:26,018 INFO L87 Difference]: Start difference. First operand 22197 states and 68309 transitions. Second operand 11 states. [2019-12-26 23:08:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:28,004 INFO L93 Difference]: Finished difference Result 34983 states and 107283 transitions. [2019-12-26 23:08:28,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 23:08:28,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 23:08:28,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:28,050 INFO L225 Difference]: With dead ends: 34983 [2019-12-26 23:08:28,050 INFO L226 Difference]: Without dead ends: 31500 [2019-12-26 23:08:28,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:08:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31500 states. [2019-12-26 23:08:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31500 to 21765. [2019-12-26 23:08:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-12-26 23:08:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 66977 transitions. [2019-12-26 23:08:28,466 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 66977 transitions. Word has length 66 [2019-12-26 23:08:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:28,466 INFO L462 AbstractCegarLoop]: Abstraction has 21765 states and 66977 transitions. [2019-12-26 23:08:28,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:08:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 66977 transitions. [2019-12-26 23:08:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:28,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:28,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:28,491 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-26 23:08:28,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:28,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001478338] [2019-12-26 23:08:28,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:28,553 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-26 23:08:28,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001478338] [2019-12-26 23:08:28,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:28,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:08:28,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499342741] [2019-12-26 23:08:28,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:08:28,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:28,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:08:28,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:08:28,555 INFO L87 Difference]: Start difference. First operand 21765 states and 66977 transitions. Second operand 3 states. [2019-12-26 23:08:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:28,646 INFO L93 Difference]: Finished difference Result 21765 states and 66976 transitions. [2019-12-26 23:08:28,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:08:28,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:08:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:28,685 INFO L225 Difference]: With dead ends: 21765 [2019-12-26 23:08:28,685 INFO L226 Difference]: Without dead ends: 21765 [2019-12-26 23:08:28,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:08:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21765 states. [2019-12-26 23:08:29,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21765 to 18882. [2019-12-26 23:08:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18882 states. [2019-12-26 23:08:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18882 states to 18882 states and 58755 transitions. [2019-12-26 23:08:29,202 INFO L78 Accepts]: Start accepts. Automaton has 18882 states and 58755 transitions. Word has length 66 [2019-12-26 23:08:29,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:29,202 INFO L462 AbstractCegarLoop]: Abstraction has 18882 states and 58755 transitions. [2019-12-26 23:08:29,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:08:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 18882 states and 58755 transitions. [2019-12-26 23:08:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:08:29,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:29,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:29,224 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:29,224 INFO L82 PathProgramCache]: Analyzing trace with hash 397917466, now seen corresponding path program 1 times [2019-12-26 23:08:29,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:29,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539326181] [2019-12-26 23:08:29,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:29,385 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-26 23:08:29,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539326181] [2019-12-26 23:08:29,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:29,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:08:29,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687832114] [2019-12-26 23:08:29,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:08:29,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:29,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:08:29,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:08:29,387 INFO L87 Difference]: Start difference. First operand 18882 states and 58755 transitions. Second operand 11 states. [2019-12-26 23:08:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:31,495 INFO L93 Difference]: Finished difference Result 30177 states and 93523 transitions. [2019-12-26 23:08:31,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 23:08:31,496 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 23:08:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:31,537 INFO L225 Difference]: With dead ends: 30177 [2019-12-26 23:08:31,537 INFO L226 Difference]: Without dead ends: 27104 [2019-12-26 23:08:31,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:08:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27104 states. [2019-12-26 23:08:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27104 to 19104. [2019-12-26 23:08:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19104 states. [2019-12-26 23:08:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19104 states to 19104 states and 59337 transitions. [2019-12-26 23:08:31,899 INFO L78 Accepts]: Start accepts. Automaton has 19104 states and 59337 transitions. Word has length 67 [2019-12-26 23:08:31,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:31,899 INFO L462 AbstractCegarLoop]: Abstraction has 19104 states and 59337 transitions. [2019-12-26 23:08:31,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:08:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 19104 states and 59337 transitions. [2019-12-26 23:08:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:08:31,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:31,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:31,932 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:31,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:31,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1803113718, now seen corresponding path program 2 times [2019-12-26 23:08:31,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:31,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101935513] [2019-12-26 23:08:31,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:08:33,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101935513] [2019-12-26 23:08:33,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:33,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-26 23:08:33,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668812599] [2019-12-26 23:08:33,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-26 23:08:33,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:33,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-26 23:08:33,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:08:33,020 INFO L87 Difference]: Start difference. First operand 19104 states and 59337 transitions. Second operand 22 states. [2019-12-26 23:08:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:41,100 INFO L93 Difference]: Finished difference Result 30106 states and 92078 transitions. [2019-12-26 23:08:41,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-26 23:08:41,101 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-26 23:08:41,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:41,141 INFO L225 Difference]: With dead ends: 30106 [2019-12-26 23:08:41,141 INFO L226 Difference]: Without dead ends: 28935 [2019-12-26 23:08:41,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=383, Invalid=2479, Unknown=0, NotChecked=0, Total=2862 [2019-12-26 23:08:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28935 states. [2019-12-26 23:08:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28935 to 21785. [2019-12-26 23:08:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21785 states. [2019-12-26 23:08:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21785 states to 21785 states and 67481 transitions. [2019-12-26 23:08:41,517 INFO L78 Accepts]: Start accepts. Automaton has 21785 states and 67481 transitions. Word has length 67 [2019-12-26 23:08:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:41,517 INFO L462 AbstractCegarLoop]: Abstraction has 21785 states and 67481 transitions. [2019-12-26 23:08:41,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-26 23:08:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 21785 states and 67481 transitions. [2019-12-26 23:08:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:08:41,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:41,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:41,541 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:41,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:41,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1857250972, now seen corresponding path program 3 times [2019-12-26 23:08:41,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:41,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127196351] [2019-12-26 23:08:41,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:42,113 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-26 23:08:42,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127196351] [2019-12-26 23:08:42,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:42,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:08:42,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437094071] [2019-12-26 23:08:42,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:08:42,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:42,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:08:42,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:08:42,116 INFO L87 Difference]: Start difference. First operand 21785 states and 67481 transitions. Second operand 19 states. [2019-12-26 23:08:45,777 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-26 23:08:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:51,272 INFO L93 Difference]: Finished difference Result 36072 states and 111523 transitions. [2019-12-26 23:08:51,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-26 23:08:51,272 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-26 23:08:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:51,320 INFO L225 Difference]: With dead ends: 36072 [2019-12-26 23:08:51,321 INFO L226 Difference]: Without dead ends: 35023 [2019-12-26 23:08:51,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=574, Invalid=3848, Unknown=0, NotChecked=0, Total=4422 [2019-12-26 23:08:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35023 states. [2019-12-26 23:08:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35023 to 23890. [2019-12-26 23:08:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23890 states. [2019-12-26 23:08:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23890 states to 23890 states and 74027 transitions. [2019-12-26 23:08:51,752 INFO L78 Accepts]: Start accepts. Automaton has 23890 states and 74027 transitions. Word has length 67 [2019-12-26 23:08:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:51,752 INFO L462 AbstractCegarLoop]: Abstraction has 23890 states and 74027 transitions. [2019-12-26 23:08:51,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:08:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 23890 states and 74027 transitions. [2019-12-26 23:08:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:08:51,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:51,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:08:51,779 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:08:51,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:51,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2040469818, now seen corresponding path program 4 times [2019-12-26 23:08:51,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:51,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732759100] [2019-12-26 23:08:51,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:52,324 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-26 23:08:52,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732759100] [2019-12-26 23:08:52,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:52,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:08:52,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247331789] [2019-12-26 23:08:52,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:08:52,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:08:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:08:52,328 INFO L87 Difference]: Start difference. First operand 23890 states and 74027 transitions. Second operand 19 states. [2019-12-26 23:09:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:00,207 INFO L93 Difference]: Finished difference Result 36025 states and 110254 transitions. [2019-12-26 23:09:00,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-26 23:09:00,208 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-26 23:09:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:00,256 INFO L225 Difference]: With dead ends: 36025 [2019-12-26 23:09:00,256 INFO L226 Difference]: Without dead ends: 33276 [2019-12-26 23:09:00,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=542, Invalid=2998, Unknown=0, NotChecked=0, Total=3540 [2019-12-26 23:09:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33276 states. [2019-12-26 23:09:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33276 to 22570. [2019-12-26 23:09:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22570 states. [2019-12-26 23:09:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22570 states to 22570 states and 69635 transitions. [2019-12-26 23:09:00,646 INFO L78 Accepts]: Start accepts. Automaton has 22570 states and 69635 transitions. Word has length 67 [2019-12-26 23:09:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:00,647 INFO L462 AbstractCegarLoop]: Abstraction has 22570 states and 69635 transitions. [2019-12-26 23:09:00,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:09:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 22570 states and 69635 transitions. [2019-12-26 23:09:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:09:00,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:00,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:09:00,668 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:00,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1575321640, now seen corresponding path program 5 times [2019-12-26 23:09:00,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:00,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20955619] [2019-12-26 23:09:00,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:01,332 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-26 23:09:01,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20955619] [2019-12-26 23:09:01,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:01,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 23:09:01,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467690102] [2019-12-26 23:09:01,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 23:09:01,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:01,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 23:09:01,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:09:01,335 INFO L87 Difference]: Start difference. First operand 22570 states and 69635 transitions. Second operand 20 states. [2019-12-26 23:09:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:09,149 INFO L93 Difference]: Finished difference Result 38984 states and 116393 transitions. [2019-12-26 23:09:09,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-26 23:09:09,150 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-26 23:09:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:09,199 INFO L225 Difference]: With dead ends: 38984 [2019-12-26 23:09:09,200 INFO L226 Difference]: Without dead ends: 36722 [2019-12-26 23:09:09,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=832, Invalid=4570, Unknown=0, NotChecked=0, Total=5402 [2019-12-26 23:09:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36722 states. [2019-12-26 23:09:09,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36722 to 22517. [2019-12-26 23:09:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22517 states. [2019-12-26 23:09:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22517 states to 22517 states and 69368 transitions. [2019-12-26 23:09:09,644 INFO L78 Accepts]: Start accepts. Automaton has 22517 states and 69368 transitions. Word has length 67 [2019-12-26 23:09:09,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:09,645 INFO L462 AbstractCegarLoop]: Abstraction has 22517 states and 69368 transitions. [2019-12-26 23:09:09,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 23:09:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 22517 states and 69368 transitions. [2019-12-26 23:09:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:09:09,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:09,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:09:09,668 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash -471224516, now seen corresponding path program 6 times [2019-12-26 23:09:09,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:09,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192580342] [2019-12-26 23:09:09,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:09:10,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192580342] [2019-12-26 23:09:10,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:10,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 23:09:10,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745939412] [2019-12-26 23:09:10,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 23:09:10,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:10,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 23:09:10,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:09:10,073 INFO L87 Difference]: Start difference. First operand 22517 states and 69368 transitions. Second operand 15 states. [2019-12-26 23:09:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:15,451 INFO L93 Difference]: Finished difference Result 38058 states and 114768 transitions. [2019-12-26 23:09:15,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-26 23:09:15,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-26 23:09:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:15,500 INFO L225 Difference]: With dead ends: 38058 [2019-12-26 23:09:15,500 INFO L226 Difference]: Without dead ends: 35694 [2019-12-26 23:09:15,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=1367, Unknown=0, NotChecked=0, Total=1640 [2019-12-26 23:09:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35694 states. [2019-12-26 23:09:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35694 to 22276. [2019-12-26 23:09:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22276 states. [2019-12-26 23:09:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22276 states to 22276 states and 68564 transitions. [2019-12-26 23:09:15,933 INFO L78 Accepts]: Start accepts. Automaton has 22276 states and 68564 transitions. Word has length 67 [2019-12-26 23:09:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:15,933 INFO L462 AbstractCegarLoop]: Abstraction has 22276 states and 68564 transitions. [2019-12-26 23:09:15,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 23:09:15,933 INFO L276 IsEmpty]: Start isEmpty. Operand 22276 states and 68564 transitions. [2019-12-26 23:09:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:09:15,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:15,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:09:15,958 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:15,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:15,959 INFO L82 PathProgramCache]: Analyzing trace with hash -769346954, now seen corresponding path program 7 times [2019-12-26 23:09:15,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:15,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287620123] [2019-12-26 23:09:15,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:09:16,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287620123] [2019-12-26 23:09:16,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:16,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-26 23:09:16,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161662997] [2019-12-26 23:09:16,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-26 23:09:16,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:16,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-26 23:09:16,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:09:16,856 INFO L87 Difference]: Start difference. First operand 22276 states and 68564 transitions. Second operand 23 states. [2019-12-26 23:09:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:21,966 INFO L93 Difference]: Finished difference Result 26759 states and 81211 transitions. [2019-12-26 23:09:21,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 23:09:21,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-26 23:09:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:22,004 INFO L225 Difference]: With dead ends: 26759 [2019-12-26 23:09:22,004 INFO L226 Difference]: Without dead ends: 25858 [2019-12-26 23:09:22,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2019-12-26 23:09:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25858 states. [2019-12-26 23:09:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25858 to 22415. [2019-12-26 23:09:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22415 states. [2019-12-26 23:09:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22415 states to 22415 states and 68912 transitions. [2019-12-26 23:09:22,552 INFO L78 Accepts]: Start accepts. Automaton has 22415 states and 68912 transitions. Word has length 67 [2019-12-26 23:09:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:22,552 INFO L462 AbstractCegarLoop]: Abstraction has 22415 states and 68912 transitions. [2019-12-26 23:09:22,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-26 23:09:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 22415 states and 68912 transitions. [2019-12-26 23:09:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:09:22,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:22,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:09:22,578 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash -715209700, now seen corresponding path program 8 times [2019-12-26 23:09:22,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:22,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686647917] [2019-12-26 23:09:22,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:23,210 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-26 23:09:23,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686647917] [2019-12-26 23:09:23,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:23,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-26 23:09:23,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268593225] [2019-12-26 23:09:23,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-26 23:09:23,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:23,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-26 23:09:23,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:09:23,212 INFO L87 Difference]: Start difference. First operand 22415 states and 68912 transitions. Second operand 23 states. [2019-12-26 23:09:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:29,279 INFO L93 Difference]: Finished difference Result 27917 states and 84249 transitions. [2019-12-26 23:09:29,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-26 23:09:29,280 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-26 23:09:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:29,322 INFO L225 Difference]: With dead ends: 27917 [2019-12-26 23:09:29,322 INFO L226 Difference]: Without dead ends: 26198 [2019-12-26 23:09:29,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=470, Invalid=2610, Unknown=0, NotChecked=0, Total=3080 [2019-12-26 23:09:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26198 states. [2019-12-26 23:09:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26198 to 22579. [2019-12-26 23:09:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22579 states. [2019-12-26 23:09:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22579 states to 22579 states and 69294 transitions. [2019-12-26 23:09:29,678 INFO L78 Accepts]: Start accepts. Automaton has 22579 states and 69294 transitions. Word has length 67 [2019-12-26 23:09:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:29,678 INFO L462 AbstractCegarLoop]: Abstraction has 22579 states and 69294 transitions. [2019-12-26 23:09:29,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-26 23:09:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 22579 states and 69294 transitions. [2019-12-26 23:09:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:09:29,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:29,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:09:29,704 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2020636268, now seen corresponding path program 9 times [2019-12-26 23:09:29,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:29,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534063132] [2019-12-26 23:09:29,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:30,338 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-26 23:09:30,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534063132] [2019-12-26 23:09:30,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:30,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-26 23:09:30,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655720217] [2019-12-26 23:09:30,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-26 23:09:30,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:30,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-26 23:09:30,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:09:30,340 INFO L87 Difference]: Start difference. First operand 22579 states and 69294 transitions. Second operand 23 states. [2019-12-26 23:09:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:35,978 INFO L93 Difference]: Finished difference Result 25667 states and 77917 transitions. [2019-12-26 23:09:35,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-26 23:09:35,979 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-26 23:09:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:36,012 INFO L225 Difference]: With dead ends: 25667 [2019-12-26 23:09:36,012 INFO L226 Difference]: Without dead ends: 23959 [2019-12-26 23:09:36,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2019-12-26 23:09:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23959 states. [2019-12-26 23:09:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23959 to 22655. [2019-12-26 23:09:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22655 states. [2019-12-26 23:09:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22655 states to 22655 states and 69487 transitions. [2019-12-26 23:09:36,349 INFO L78 Accepts]: Start accepts. Automaton has 22655 states and 69487 transitions. Word has length 67 [2019-12-26 23:09:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:36,349 INFO L462 AbstractCegarLoop]: Abstraction has 22655 states and 69487 transitions. [2019-12-26 23:09:36,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-26 23:09:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 22655 states and 69487 transitions. [2019-12-26 23:09:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:09:36,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:36,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:09:36,374 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:36,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:36,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2074773522, now seen corresponding path program 10 times [2019-12-26 23:09:36,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:36,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215524163] [2019-12-26 23:09:36,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:36,560 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-26 23:09:36,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215524163] [2019-12-26 23:09:36,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:36,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:09:36,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612258989] [2019-12-26 23:09:36,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:09:36,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:36,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:09:36,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:09:36,565 INFO L87 Difference]: Start difference. First operand 22655 states and 69487 transitions. Second operand 12 states. [2019-12-26 23:09:39,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:39,602 INFO L93 Difference]: Finished difference Result 37351 states and 113507 transitions. [2019-12-26 23:09:39,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-26 23:09:39,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 23:09:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:39,648 INFO L225 Difference]: With dead ends: 37351 [2019-12-26 23:09:39,648 INFO L226 Difference]: Without dead ends: 33366 [2019-12-26 23:09:39,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 23:09:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33366 states. [2019-12-26 23:09:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33366 to 21850. [2019-12-26 23:09:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21850 states. [2019-12-26 23:09:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21850 states to 21850 states and 67271 transitions. [2019-12-26 23:09:40,237 INFO L78 Accepts]: Start accepts. Automaton has 21850 states and 67271 transitions. Word has length 67 [2019-12-26 23:09:40,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:40,237 INFO L462 AbstractCegarLoop]: Abstraction has 21850 states and 67271 transitions. [2019-12-26 23:09:40,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:09:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 21850 states and 67271 transitions. [2019-12-26 23:09:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:09:40,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:40,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:09:40,258 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:40,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 11 times [2019-12-26 23:09:40,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:40,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167910299] [2019-12-26 23:09:40,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:09:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:09:40,452 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:09:40,452 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:09:40,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1567~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1567~0.base_23|) |v_ULTIMATE.start_main_~#t1567~0.offset_17| 0)) |v_#memory_int_17|) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1567~0.base_23|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1567~0.base_23| 1) |v_#valid_60|) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1567~0.base_23| 4) |v_#length_21|) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= (select .cse0 |v_ULTIMATE.start_main_~#t1567~0.base_23|) 0) (= |v_ULTIMATE.start_main_~#t1567~0.offset_17| 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1567~0.offset=|v_ULTIMATE.start_main_~#t1567~0.offset_17|, ULTIMATE.start_main_~#t1568~0.base=|v_ULTIMATE.start_main_~#t1568~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ULTIMATE.start_main_~#t1567~0.base=|v_ULTIMATE.start_main_~#t1567~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1568~0.offset=|v_ULTIMATE.start_main_~#t1568~0.offset_12|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1569~0.base=|v_ULTIMATE.start_main_~#t1569~0.base_17|, ULTIMATE.start_main_~#t1569~0.offset=|v_ULTIMATE.start_main_~#t1569~0.offset_14|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1567~0.offset, ULTIMATE.start_main_~#t1568~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1567~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1568~0.offset, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1569~0.base, ULTIMATE.start_main_~#t1569~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:09:40,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1568~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1568~0.base_11|)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1568~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1568~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1568~0.base_11|) |v_ULTIMATE.start_main_~#t1568~0.offset_9| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t1568~0.offset_9| 0) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1568~0.base_11| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1568~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1568~0.base=|v_ULTIMATE.start_main_~#t1568~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1568~0.offset=|v_ULTIMATE.start_main_~#t1568~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1568~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1568~0.offset] because there is no mapped edge [2019-12-26 23:09:40,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:09:40,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In958161324 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In958161324 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In958161324 |P1Thread1of1ForFork2_#t~ite9_Out958161324|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out958161324| ~z~0_In958161324)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In958161324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In958161324, ~z$w_buff1~0=~z$w_buff1~0_In958161324, ~z~0=~z~0_In958161324} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out958161324|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In958161324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In958161324, ~z$w_buff1~0=~z$w_buff1~0_In958161324, ~z~0=~z~0_In958161324} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 23:09:40,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-26 23:09:40,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1569~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1569~0.base_13|) |v_ULTIMATE.start_main_~#t1569~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1569~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1569~0.base_13| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1569~0.base_13| 4)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1569~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1569~0.offset_11| 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1569~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1569~0.base=|v_ULTIMATE.start_main_~#t1569~0.base_13|, ULTIMATE.start_main_~#t1569~0.offset=|v_ULTIMATE.start_main_~#t1569~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1569~0.base, ULTIMATE.start_main_~#t1569~0.offset, #length] because there is no mapped edge [2019-12-26 23:09:40,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In736389371 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In736389371 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out736389371| ~z$w_buff0_used~0_In736389371) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out736389371| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In736389371, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In736389371} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In736389371, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out736389371|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In736389371} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 23:09:40,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-747270390 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-747270390 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-747270390 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-747270390 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-747270390 |P1Thread1of1ForFork2_#t~ite12_Out-747270390|)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-747270390| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-747270390, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-747270390, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-747270390, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-747270390} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-747270390, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-747270390, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-747270390, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-747270390|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-747270390} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 23:09:40,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-264315021 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-264315021 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-264315021|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-264315021 |P1Thread1of1ForFork2_#t~ite13_Out-264315021|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-264315021, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-264315021} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-264315021, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-264315021|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-264315021} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 23:09:40,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1025529065 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1025529065| |P2Thread1of1ForFork0_#t~ite26_Out-1025529065|) (= ~z$w_buff0_used~0_In-1025529065 |P2Thread1of1ForFork0_#t~ite26_Out-1025529065|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1025529065 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-1025529065 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-1025529065 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-1025529065 256) 0)))) (and (= |P2Thread1of1ForFork0_#t~ite26_In-1025529065| |P2Thread1of1ForFork0_#t~ite26_Out-1025529065|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-1025529065| ~z$w_buff0_used~0_In-1025529065)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1025529065|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1025529065, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1025529065, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1025529065, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1025529065, ~weak$$choice2~0=~weak$$choice2~0_In-1025529065} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1025529065|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1025529065|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1025529065, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1025529065, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1025529065, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1025529065, ~weak$$choice2~0=~weak$$choice2~0_In-1025529065} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 23:09:40,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 23:09:40,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1147587155 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1147587155 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1147587155 |P0Thread1of1ForFork1_#t~ite5_Out-1147587155|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1147587155|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1147587155, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1147587155} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1147587155|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1147587155, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1147587155} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 23:09:40,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 23:09:40,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out30364899| |P2Thread1of1ForFork0_#t~ite38_Out30364899|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In30364899 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In30364899 256) 0))) (or (and (not .cse0) .cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out30364899| ~z$w_buff1~0_In30364899) (not .cse2)) (and .cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out30364899| ~z~0_In30364899) (or .cse0 .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In30364899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In30364899, ~z$w_buff1~0=~z$w_buff1~0_In30364899, ~z~0=~z~0_In30364899} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out30364899|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out30364899|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In30364899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In30364899, ~z$w_buff1~0=~z$w_buff1~0_In30364899, ~z~0=~z~0_In30364899} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 23:09:40,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1658864851 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1658864851 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1658864851 |P2Thread1of1ForFork0_#t~ite40_Out-1658864851|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1658864851|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1658864851, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1658864851} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1658864851, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1658864851|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1658864851} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 23:09:40,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1147375050 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1147375050 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1147375050 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1147375050 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1147375050|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1147375050 |P2Thread1of1ForFork0_#t~ite41_Out1147375050|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1147375050, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1147375050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1147375050, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1147375050} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1147375050, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1147375050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1147375050, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1147375050, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1147375050|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 23:09:40,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1702459577 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1702459577 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1702459577|) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1702459577| ~z$r_buff0_thd3~0_In-1702459577)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1702459577, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1702459577} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1702459577, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1702459577, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1702459577|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 23:09:40,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1947640877 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1947640877 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1947640877 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1947640877 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1947640877 |P2Thread1of1ForFork0_#t~ite43_Out1947640877|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out1947640877| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1947640877, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1947640877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1947640877, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1947640877} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1947640877|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1947640877, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1947640877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1947640877, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1947640877} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 23:09:40,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 23:09:40,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-2069650118 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2069650118 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-2069650118 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-2069650118 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-2069650118| ~z$w_buff1_used~0_In-2069650118) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-2069650118| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2069650118, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2069650118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2069650118, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2069650118} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2069650118, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2069650118|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2069650118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2069650118, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2069650118} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 23:09:40,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In221850789 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In221850789 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In221850789 ~z$r_buff0_thd1~0_Out221850789)) (and (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out221850789) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In221850789, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In221850789} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In221850789, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out221850789|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out221850789} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:09:40,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In-1332955230 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1332955230 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1332955230 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1332955230 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1332955230| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1332955230| ~z$r_buff1_thd1~0_In-1332955230) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1332955230, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1332955230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1332955230, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1332955230} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1332955230|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1332955230, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1332955230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1332955230, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1332955230} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 23:09:40,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:09:40,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-1592520603 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1592520603 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1592520603 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1592520603 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1592520603| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out-1592520603| ~z$r_buff1_thd2~0_In-1592520603) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1592520603, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1592520603, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1592520603, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1592520603} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1592520603, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1592520603, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1592520603, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1592520603|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1592520603} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 23:09:40,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 23:09:40,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:09:40,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-483951598 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-483951598| |ULTIMATE.start_main_#t~ite48_Out-483951598|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-483951598 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out-483951598| ~z~0_In-483951598) (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-483951598| ~z$w_buff1~0_In-483951598)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-483951598, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-483951598, ~z$w_buff1~0=~z$w_buff1~0_In-483951598, ~z~0=~z~0_In-483951598} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-483951598, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-483951598|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-483951598, ~z$w_buff1~0=~z$w_buff1~0_In-483951598, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-483951598|, ~z~0=~z~0_In-483951598} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:09:40,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1961739570 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1961739570 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1961739570| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1961739570| ~z$w_buff0_used~0_In-1961739570)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1961739570, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1961739570} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1961739570, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1961739570, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1961739570|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 23:09:40,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1067667234 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1067667234 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1067667234 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1067667234 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1067667234|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1067667234 |ULTIMATE.start_main_#t~ite50_Out1067667234|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1067667234, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1067667234, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1067667234, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1067667234} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1067667234|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1067667234, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1067667234, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1067667234, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1067667234} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 23:09:40,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-109179232 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-109179232 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-109179232 |ULTIMATE.start_main_#t~ite51_Out-109179232|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-109179232|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-109179232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-109179232} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-109179232, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-109179232|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-109179232} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 23:09:40,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In194311983 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In194311983 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In194311983 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In194311983 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out194311983|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In194311983 |ULTIMATE.start_main_#t~ite52_Out194311983|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In194311983, ~z$w_buff0_used~0=~z$w_buff0_used~0_In194311983, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In194311983, ~z$w_buff1_used~0=~z$w_buff1_used~0_In194311983} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out194311983|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In194311983, ~z$w_buff0_used~0=~z$w_buff0_used~0_In194311983, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In194311983, ~z$w_buff1_used~0=~z$w_buff1_used~0_In194311983} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 23:09:40,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:09:40,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:09:40 BasicIcfg [2019-12-26 23:09:40,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:09:40,597 INFO L168 Benchmark]: Toolchain (without parser) took 165733.31 ms. Allocated memory was 140.0 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 100.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-26 23:09:40,597 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 140.0 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 23:09:40,597 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.19 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 156.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:40,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.43 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:40,598 INFO L168 Benchmark]: Boogie Preprocessor took 40.57 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:40,599 INFO L168 Benchmark]: RCFGBuilder took 818.09 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 101.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:40,605 INFO L168 Benchmark]: TraceAbstraction took 163967.94 ms. Allocated memory was 203.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-26 23:09:40,607 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.26 ms. Allocated memory is still 140.0 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.19 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 156.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.43 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.57 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 818.09 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 101.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 163967.94 ms. Allocated memory was 203.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1569, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 163.6s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 88.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8432 SDtfs, 11602 SDslu, 42598 SDs, 0 SdLazy, 64558 SolverSat, 840 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 707 GetRequests, 49 SyntacticMatches, 30 SemanticMatches, 628 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6425 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 252126 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1593 NumberOfCodeBlocks, 1593 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1496 ConstructedInterpolants, 0 QuantifiedInterpolants, 542558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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 proved your program to be incorrect! Received shutdown request...