/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:13:28,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:13:28,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:13:28,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:13:28,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:13:28,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:13:28,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:13:28,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:13:28,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:13:28,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:13:28,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:13:28,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:13:28,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:13:28,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:13:28,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:13:28,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:13:28,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:13:28,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:13:28,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:13:28,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:13:28,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:13:28,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:13:28,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:13:28,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:13:28,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:13:28,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:13:28,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:13:28,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:13:28,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:13:28,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:13:28,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:13:28,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:13:28,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:13:28,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:13:28,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:13:28,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:13:28,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:13:28,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:13:28,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:13:28,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:13:28,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:13:28,563 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:13:28,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:13:28,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:13:28,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:13:28,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:13:28,579 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:13:28,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:13:28,579 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:13:28,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:13:28,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:13:28,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:13:28,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:13:28,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:13:28,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:13:28,580 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:13:28,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:13:28,581 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:13:28,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:13:28,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:13:28,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:13:28,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:13:28,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:13:28,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:13:28,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:13:28,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:13:28,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:13:28,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:13:28,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:13:28,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:13:28,583 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:13:28,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:13:28,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:13:28,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:13:28,947 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:13:28,948 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:13:28,948 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-27 01:13:29,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d7008be/3ec31c6cd90d4d728c1e108f7fd9b2fe/FLAGe02c0078d [2019-12-27 01:13:29,580 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:13:29,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-27 01:13:29,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d7008be/3ec31c6cd90d4d728c1e108f7fd9b2fe/FLAGe02c0078d [2019-12-27 01:13:29,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d7008be/3ec31c6cd90d4d728c1e108f7fd9b2fe [2019-12-27 01:13:29,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:13:29,872 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:13:29,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:13:29,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:13:29,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:13:29,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:13:29" (1/1) ... [2019-12-27 01:13:29,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc7de13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:29, skipping insertion in model container [2019-12-27 01:13:29,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:13:29" (1/1) ... [2019-12-27 01:13:29,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:13:29,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:13:30,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:13:30,582 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:13:30,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:13:30,727 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:13:30,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:30 WrapperNode [2019-12-27 01:13:30,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:13:30,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:13:30,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:13:30,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:13:30,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:30" (1/1) ... [2019-12-27 01:13:30,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:30" (1/1) ... [2019-12-27 01:13:30,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:13:30,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:13:30,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:13:30,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:13:30,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:30" (1/1) ... [2019-12-27 01:13:30,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:30" (1/1) ... [2019-12-27 01:13:30,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:30" (1/1) ... [2019-12-27 01:13:30,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:30" (1/1) ... [2019-12-27 01:13:30,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:30" (1/1) ... [2019-12-27 01:13:30,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:30" (1/1) ... [2019-12-27 01:13:30,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:30" (1/1) ... [2019-12-27 01:13:30,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:13:30,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:13:30,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:13:30,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:13:30,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:13:30,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:13:30,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:13:30,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:13:30,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:13:30,912 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:13:30,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:13:30,913 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:13:30,913 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:13:30,913 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:13:30,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:13:30,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:13:30,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:13:30,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:13:30,916 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:13:31,710 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:13:31,711 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:13:31,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:13:31 BoogieIcfgContainer [2019-12-27 01:13:31,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:13:31,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:13:31,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:13:31,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:13:31,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:13:29" (1/3) ... [2019-12-27 01:13:31,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc7017e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:13:31, skipping insertion in model container [2019-12-27 01:13:31,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:13:30" (2/3) ... [2019-12-27 01:13:31,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc7017e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:13:31, skipping insertion in model container [2019-12-27 01:13:31,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:13:31" (3/3) ... [2019-12-27 01:13:31,721 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc.i [2019-12-27 01:13:31,734 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:13:31,735 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:13:31,747 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:13:31,748 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:13:31,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,806 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,806 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,806 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,807 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,807 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,822 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,822 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,849 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,851 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,859 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,860 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,860 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,865 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:13:31,899 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:13:31,920 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:13:31,920 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:13:31,920 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:13:31,920 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:13:31,920 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:13:31,921 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:13:31,921 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:13:31,921 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:13:31,943 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 01:13:31,945 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 01:13:32,094 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 01:13:32,095 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:13:32,111 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:13:32,134 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 01:13:32,191 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 01:13:32,191 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:13:32,200 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:13:32,223 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:13:32,224 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:13:37,648 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 01:13:37,817 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 01:13:37,842 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78628 [2019-12-27 01:13:37,842 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 01:13:37,846 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 01:13:54,945 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110182 states. [2019-12-27 01:13:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 110182 states. [2019-12-27 01:13:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:13:54,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:13:54,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:13:54,953 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-27 01:13:54,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:13:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash 917838, now seen corresponding path program 1 times [2019-12-27 01:13:54,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:13:54,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006280946] [2019-12-27 01:13:54,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:13:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:13:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:13:55,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006280946] [2019-12-27 01:13:55,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:13:55,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:13:55,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133888880] [2019-12-27 01:13:55,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:13:55,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:13:55,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:13:55,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:13:55,217 INFO L87 Difference]: Start difference. First operand 110182 states. Second operand 3 states. [2019-12-27 01:13:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:13:57,502 INFO L93 Difference]: Finished difference Result 109312 states and 463550 transitions. [2019-12-27 01:13:57,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:13:57,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:13:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:00,709 INFO L225 Difference]: With dead ends: 109312 [2019-12-27 01:14:00,709 INFO L226 Difference]: Without dead ends: 102592 [2019-12-27 01:14:00,711 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-27 01:14:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2019-12-27 01:14:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102592. [2019-12-27 01:14:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102592 states. [2019-12-27 01:14:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102592 states to 102592 states and 434430 transitions. [2019-12-27 01:14:12,518 INFO L78 Accepts]: Start accepts. Automaton has 102592 states and 434430 transitions. Word has length 3 [2019-12-27 01:14:12,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:12,518 INFO L462 AbstractCegarLoop]: Abstraction has 102592 states and 434430 transitions. [2019-12-27 01:14:12,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:14:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 102592 states and 434430 transitions. [2019-12-27 01:14:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:14:12,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:12,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:14:12,522 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-27 01:14:12,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:12,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1857942485, now seen corresponding path program 1 times [2019-12-27 01:14:12,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:12,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971626705] [2019-12-27 01:14:12,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:12,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971626705] [2019-12-27 01:14:12,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:12,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:14:12,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799860222] [2019-12-27 01:14:12,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:14:12,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:12,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:14:12,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:14:12,668 INFO L87 Difference]: Start difference. First operand 102592 states and 434430 transitions. Second operand 4 states. [2019-12-27 01:14:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:13,888 INFO L93 Difference]: Finished difference Result 159508 states and 648686 transitions. [2019-12-27 01:14:13,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:14:13,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:14:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:18,929 INFO L225 Difference]: With dead ends: 159508 [2019-12-27 01:14:18,929 INFO L226 Difference]: Without dead ends: 159459 [2019-12-27 01:14:18,930 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-27 01:14:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159459 states. [2019-12-27 01:14:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159459 to 146095. [2019-12-27 01:14:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146095 states. [2019-12-27 01:14:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146095 states to 146095 states and 601450 transitions. [2019-12-27 01:14:27,228 INFO L78 Accepts]: Start accepts. Automaton has 146095 states and 601450 transitions. Word has length 11 [2019-12-27 01:14:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:27,228 INFO L462 AbstractCegarLoop]: Abstraction has 146095 states and 601450 transitions. [2019-12-27 01:14:27,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:14:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 146095 states and 601450 transitions. [2019-12-27 01:14:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:14:27,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:27,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:14:27,237 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-27 01:14:27,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash 230844073, now seen corresponding path program 1 times [2019-12-27 01:14:27,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:27,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909946298] [2019-12-27 01:14:27,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:27,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-27 01:14:27,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909946298] [2019-12-27 01:14:27,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:27,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:14:27,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631406897] [2019-12-27 01:14:27,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:14:27,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:27,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:14:27,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:14:27,295 INFO L87 Difference]: Start difference. First operand 146095 states and 601450 transitions. Second operand 3 states. [2019-12-27 01:14:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:27,423 INFO L93 Difference]: Finished difference Result 32284 states and 104220 transitions. [2019-12-27 01:14:27,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:14:27,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:14:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:27,477 INFO L225 Difference]: With dead ends: 32284 [2019-12-27 01:14:27,478 INFO L226 Difference]: Without dead ends: 32284 [2019-12-27 01:14:27,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:14:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32284 states. [2019-12-27 01:14:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32284 to 32284. [2019-12-27 01:14:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32284 states. [2019-12-27 01:14:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32284 states to 32284 states and 104220 transitions. [2019-12-27 01:14:32,594 INFO L78 Accepts]: Start accepts. Automaton has 32284 states and 104220 transitions. Word has length 13 [2019-12-27 01:14:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:32,594 INFO L462 AbstractCegarLoop]: Abstraction has 32284 states and 104220 transitions. [2019-12-27 01:14:32,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:14:32,595 INFO L276 IsEmpty]: Start isEmpty. Operand 32284 states and 104220 transitions. [2019-12-27 01:14:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:14:32,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:32,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:14:32,599 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-27 01:14:32,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1069845708, now seen corresponding path program 1 times [2019-12-27 01:14:32,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:32,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657003192] [2019-12-27 01:14:32,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:32,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657003192] [2019-12-27 01:14:32,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:32,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:14:32,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015594406] [2019-12-27 01:14:32,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:14:32,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:32,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:14:32,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:14:32,686 INFO L87 Difference]: Start difference. First operand 32284 states and 104220 transitions. Second operand 4 states. [2019-12-27 01:14:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:33,073 INFO L93 Difference]: Finished difference Result 40215 states and 129418 transitions. [2019-12-27 01:14:33,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:14:33,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:14:33,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:33,158 INFO L225 Difference]: With dead ends: 40215 [2019-12-27 01:14:33,158 INFO L226 Difference]: Without dead ends: 40215 [2019-12-27 01:14:33,158 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-27 01:14:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40215 states. [2019-12-27 01:14:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40215 to 36090. [2019-12-27 01:14:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36090 states. [2019-12-27 01:14:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36090 states to 36090 states and 116495 transitions. [2019-12-27 01:14:34,171 INFO L78 Accepts]: Start accepts. Automaton has 36090 states and 116495 transitions. Word has length 16 [2019-12-27 01:14:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:34,172 INFO L462 AbstractCegarLoop]: Abstraction has 36090 states and 116495 transitions. [2019-12-27 01:14:34,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:14:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 36090 states and 116495 transitions. [2019-12-27 01:14:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:14:34,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:34,180 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-27 01:14:34,180 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-27 01:14:34,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:34,180 INFO L82 PathProgramCache]: Analyzing trace with hash 6986775, now seen corresponding path program 1 times [2019-12-27 01:14:34,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:34,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567730280] [2019-12-27 01:14:34,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:34,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567730280] [2019-12-27 01:14:34,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:34,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:14:34,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453383260] [2019-12-27 01:14:34,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:14:34,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:34,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:14:34,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:14:34,307 INFO L87 Difference]: Start difference. First operand 36090 states and 116495 transitions. Second operand 5 states. [2019-12-27 01:14:34,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:34,926 INFO L93 Difference]: Finished difference Result 46566 states and 147831 transitions. [2019-12-27 01:14:34,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:14:34,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:14:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:35,018 INFO L225 Difference]: With dead ends: 46566 [2019-12-27 01:14:35,018 INFO L226 Difference]: Without dead ends: 46559 [2019-12-27 01:14:35,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:14:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46559 states. [2019-12-27 01:14:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46559 to 35784. [2019-12-27 01:14:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2019-12-27 01:14:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 115349 transitions. [2019-12-27 01:14:35,769 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 115349 transitions. Word has length 22 [2019-12-27 01:14:35,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:35,770 INFO L462 AbstractCegarLoop]: Abstraction has 35784 states and 115349 transitions. [2019-12-27 01:14:35,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:14:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 115349 transitions. [2019-12-27 01:14:35,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:14:35,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:35,782 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-27 01:14:35,782 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-27 01:14:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:35,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1437372217, now seen corresponding path program 1 times [2019-12-27 01:14:35,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:35,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500592387] [2019-12-27 01:14:35,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:35,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500592387] [2019-12-27 01:14:35,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:35,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:14:35,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011307939] [2019-12-27 01:14:35,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:14:35,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:35,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:14:35,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:14:35,867 INFO L87 Difference]: Start difference. First operand 35784 states and 115349 transitions. Second operand 4 states. [2019-12-27 01:14:35,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:35,925 INFO L93 Difference]: Finished difference Result 14498 states and 44125 transitions. [2019-12-27 01:14:35,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:14:35,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:14:35,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:35,945 INFO L225 Difference]: With dead ends: 14498 [2019-12-27 01:14:35,945 INFO L226 Difference]: Without dead ends: 14498 [2019-12-27 01:14:35,946 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-27 01:14:36,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2019-12-27 01:14:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 14254. [2019-12-27 01:14:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14254 states. [2019-12-27 01:14:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 43429 transitions. [2019-12-27 01:14:36,461 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 43429 transitions. Word has length 25 [2019-12-27 01:14:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:36,461 INFO L462 AbstractCegarLoop]: Abstraction has 14254 states and 43429 transitions. [2019-12-27 01:14:36,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:14:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 43429 transitions. [2019-12-27 01:14:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:14:36,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:36,472 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-27 01:14:36,472 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-27 01:14:36,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:36,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1947963172, now seen corresponding path program 1 times [2019-12-27 01:14:36,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:36,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341732339] [2019-12-27 01:14:36,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:36,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341732339] [2019-12-27 01:14:36,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:36,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:14:36,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629963928] [2019-12-27 01:14:36,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:14:36,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:36,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:14:36,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:14:36,596 INFO L87 Difference]: Start difference. First operand 14254 states and 43429 transitions. Second operand 6 states. [2019-12-27 01:14:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:37,354 INFO L93 Difference]: Finished difference Result 39008 states and 118911 transitions. [2019-12-27 01:14:37,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:14:37,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 01:14:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:37,414 INFO L225 Difference]: With dead ends: 39008 [2019-12-27 01:14:37,414 INFO L226 Difference]: Without dead ends: 39008 [2019-12-27 01:14:37,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:14:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39008 states. [2019-12-27 01:14:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39008 to 21620. [2019-12-27 01:14:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-12-27 01:14:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 66985 transitions. [2019-12-27 01:14:37,876 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 66985 transitions. Word has length 27 [2019-12-27 01:14:37,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:37,876 INFO L462 AbstractCegarLoop]: Abstraction has 21620 states and 66985 transitions. [2019-12-27 01:14:37,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:14:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 66985 transitions. [2019-12-27 01:14:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:14:37,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:37,893 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] [2019-12-27 01:14:37,894 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-27 01:14:37,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:37,894 INFO L82 PathProgramCache]: Analyzing trace with hash -89566793, now seen corresponding path program 1 times [2019-12-27 01:14:37,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:37,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971799260] [2019-12-27 01:14:37,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:37,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971799260] [2019-12-27 01:14:37,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:37,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:14:37,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841662250] [2019-12-27 01:14:37,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:14:37,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:37,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:14:37,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:14:37,991 INFO L87 Difference]: Start difference. First operand 21620 states and 66985 transitions. Second operand 6 states. [2019-12-27 01:14:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:38,797 INFO L93 Difference]: Finished difference Result 43584 states and 132186 transitions. [2019-12-27 01:14:38,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:14:38,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 01:14:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:38,862 INFO L225 Difference]: With dead ends: 43584 [2019-12-27 01:14:38,862 INFO L226 Difference]: Without dead ends: 43584 [2019-12-27 01:14:38,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:14:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43584 states. [2019-12-27 01:14:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43584 to 21360. [2019-12-27 01:14:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21360 states. [2019-12-27 01:14:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21360 states to 21360 states and 66500 transitions. [2019-12-27 01:14:39,619 INFO L78 Accepts]: Start accepts. Automaton has 21360 states and 66500 transitions. Word has length 28 [2019-12-27 01:14:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:39,619 INFO L462 AbstractCegarLoop]: Abstraction has 21360 states and 66500 transitions. [2019-12-27 01:14:39,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:14:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 21360 states and 66500 transitions. [2019-12-27 01:14:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:14:39,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:39,642 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-27 01:14:39,643 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-27 01:14:39,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:39,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1720610055, now seen corresponding path program 1 times [2019-12-27 01:14:39,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:39,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679799892] [2019-12-27 01:14:39,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:39,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:39,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679799892] [2019-12-27 01:14:39,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:39,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:14:39,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592530463] [2019-12-27 01:14:39,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:14:39,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:39,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:14:39,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:14:39,747 INFO L87 Difference]: Start difference. First operand 21360 states and 66500 transitions. Second operand 7 states. [2019-12-27 01:14:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:41,100 INFO L93 Difference]: Finished difference Result 51613 states and 157651 transitions. [2019-12-27 01:14:41,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:14:41,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 01:14:41,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:41,184 INFO L225 Difference]: With dead ends: 51613 [2019-12-27 01:14:41,184 INFO L226 Difference]: Without dead ends: 51613 [2019-12-27 01:14:41,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:14:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51613 states. [2019-12-27 01:14:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51613 to 23540. [2019-12-27 01:14:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23540 states. [2019-12-27 01:14:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23540 states to 23540 states and 73219 transitions. [2019-12-27 01:14:41,766 INFO L78 Accepts]: Start accepts. Automaton has 23540 states and 73219 transitions. Word has length 33 [2019-12-27 01:14:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:41,766 INFO L462 AbstractCegarLoop]: Abstraction has 23540 states and 73219 transitions. [2019-12-27 01:14:41,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:14:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 23540 states and 73219 transitions. [2019-12-27 01:14:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:14:41,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:41,793 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-27 01:14:41,793 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-27 01:14:41,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:41,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1518720007, now seen corresponding path program 2 times [2019-12-27 01:14:41,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:41,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889490282] [2019-12-27 01:14:41,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:41,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889490282] [2019-12-27 01:14:41,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:41,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:14:41,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174066325] [2019-12-27 01:14:41,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:14:41,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:41,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:14:41,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:14:41,907 INFO L87 Difference]: Start difference. First operand 23540 states and 73219 transitions. Second operand 8 states. [2019-12-27 01:14:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:44,230 INFO L93 Difference]: Finished difference Result 79921 states and 239364 transitions. [2019-12-27 01:14:44,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 01:14:44,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 01:14:44,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:44,359 INFO L225 Difference]: With dead ends: 79921 [2019-12-27 01:14:44,359 INFO L226 Difference]: Without dead ends: 79921 [2019-12-27 01:14:44,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2019-12-27 01:14:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79921 states. [2019-12-27 01:14:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79921 to 22493. [2019-12-27 01:14:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22493 states. [2019-12-27 01:14:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22493 states to 22493 states and 69836 transitions. [2019-12-27 01:14:45,124 INFO L78 Accepts]: Start accepts. Automaton has 22493 states and 69836 transitions. Word has length 33 [2019-12-27 01:14:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:45,124 INFO L462 AbstractCegarLoop]: Abstraction has 22493 states and 69836 transitions. [2019-12-27 01:14:45,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:14:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states and 69836 transitions. [2019-12-27 01:14:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:14:45,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:45,149 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] [2019-12-27 01:14:45,149 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-27 01:14:45,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2146187134, now seen corresponding path program 1 times [2019-12-27 01:14:45,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:45,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647509344] [2019-12-27 01:14:45,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:45,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647509344] [2019-12-27 01:14:45,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:45,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:14:45,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182590645] [2019-12-27 01:14:45,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:14:45,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:45,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:14:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:14:45,265 INFO L87 Difference]: Start difference. First operand 22493 states and 69836 transitions. Second operand 7 states. [2019-12-27 01:14:46,537 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-12-27 01:14:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:46,960 INFO L93 Difference]: Finished difference Result 45327 states and 136889 transitions. [2019-12-27 01:14:46,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:14:46,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 01:14:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:47,029 INFO L225 Difference]: With dead ends: 45327 [2019-12-27 01:14:47,029 INFO L226 Difference]: Without dead ends: 45327 [2019-12-27 01:14:47,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:14:47,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45327 states. [2019-12-27 01:14:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45327 to 20305. [2019-12-27 01:14:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20305 states. [2019-12-27 01:14:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20305 states to 20305 states and 63138 transitions. [2019-12-27 01:14:47,508 INFO L78 Accepts]: Start accepts. Automaton has 20305 states and 63138 transitions. Word has length 34 [2019-12-27 01:14:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:47,508 INFO L462 AbstractCegarLoop]: Abstraction has 20305 states and 63138 transitions. [2019-12-27 01:14:47,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:14:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 20305 states and 63138 transitions. [2019-12-27 01:14:47,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:14:47,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:47,528 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] [2019-12-27 01:14:47,528 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-27 01:14:47,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:47,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1401085166, now seen corresponding path program 2 times [2019-12-27 01:14:47,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:47,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486512223] [2019-12-27 01:14:47,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:47,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486512223] [2019-12-27 01:14:47,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:47,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:14:47,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128974218] [2019-12-27 01:14:47,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:14:47,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:47,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:14:47,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:14:47,687 INFO L87 Difference]: Start difference. First operand 20305 states and 63138 transitions. Second operand 8 states. [2019-12-27 01:14:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:49,570 INFO L93 Difference]: Finished difference Result 60447 states and 179980 transitions. [2019-12-27 01:14:49,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:14:49,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 01:14:49,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:49,664 INFO L225 Difference]: With dead ends: 60447 [2019-12-27 01:14:49,664 INFO L226 Difference]: Without dead ends: 60447 [2019-12-27 01:14:49,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2019-12-27 01:14:49,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60447 states. [2019-12-27 01:14:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60447 to 18462. [2019-12-27 01:14:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18462 states. [2019-12-27 01:14:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18462 states to 18462 states and 57434 transitions. [2019-12-27 01:14:50,542 INFO L78 Accepts]: Start accepts. Automaton has 18462 states and 57434 transitions. Word has length 34 [2019-12-27 01:14:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:50,543 INFO L462 AbstractCegarLoop]: Abstraction has 18462 states and 57434 transitions. [2019-12-27 01:14:50,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:14:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 18462 states and 57434 transitions. [2019-12-27 01:14:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:14:50,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:50,562 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-27 01:14:50,562 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-27 01:14:50,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:50,562 INFO L82 PathProgramCache]: Analyzing trace with hash 342833665, now seen corresponding path program 1 times [2019-12-27 01:14:50,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:50,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198269184] [2019-12-27 01:14:50,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:50,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198269184] [2019-12-27 01:14:50,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:50,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:14:50,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578298525] [2019-12-27 01:14:50,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:14:50,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:50,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:14:50,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:14:50,628 INFO L87 Difference]: Start difference. First operand 18462 states and 57434 transitions. Second operand 3 states. [2019-12-27 01:14:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:50,708 INFO L93 Difference]: Finished difference Result 18461 states and 57432 transitions. [2019-12-27 01:14:50,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:14:50,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:14:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:50,737 INFO L225 Difference]: With dead ends: 18461 [2019-12-27 01:14:50,737 INFO L226 Difference]: Without dead ends: 18461 [2019-12-27 01:14:50,738 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-27 01:14:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18461 states. [2019-12-27 01:14:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18461 to 18461. [2019-12-27 01:14:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18461 states. [2019-12-27 01:14:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18461 states to 18461 states and 57432 transitions. [2019-12-27 01:14:51,010 INFO L78 Accepts]: Start accepts. Automaton has 18461 states and 57432 transitions. Word has length 39 [2019-12-27 01:14:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:51,010 INFO L462 AbstractCegarLoop]: Abstraction has 18461 states and 57432 transitions. [2019-12-27 01:14:51,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:14:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 18461 states and 57432 transitions. [2019-12-27 01:14:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:14:51,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:51,034 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] [2019-12-27 01:14:51,034 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-27 01:14:51,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:51,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1054064562, now seen corresponding path program 1 times [2019-12-27 01:14:51,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:51,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018129203] [2019-12-27 01:14:51,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:51,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:51,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018129203] [2019-12-27 01:14:51,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:51,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:14:51,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660985564] [2019-12-27 01:14:51,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:14:51,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:51,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:14:51,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:14:51,081 INFO L87 Difference]: Start difference. First operand 18461 states and 57432 transitions. Second operand 3 states. [2019-12-27 01:14:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:51,219 INFO L93 Difference]: Finished difference Result 32125 states and 100306 transitions. [2019-12-27 01:14:51,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:14:51,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 01:14:51,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:51,254 INFO L225 Difference]: With dead ends: 32125 [2019-12-27 01:14:51,254 INFO L226 Difference]: Without dead ends: 16527 [2019-12-27 01:14:51,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:14:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16527 states. [2019-12-27 01:14:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16527 to 16461. [2019-12-27 01:14:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16461 states. [2019-12-27 01:14:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16461 states to 16461 states and 50424 transitions. [2019-12-27 01:14:51,671 INFO L78 Accepts]: Start accepts. Automaton has 16461 states and 50424 transitions. Word has length 40 [2019-12-27 01:14:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:51,671 INFO L462 AbstractCegarLoop]: Abstraction has 16461 states and 50424 transitions. [2019-12-27 01:14:51,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:14:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 16461 states and 50424 transitions. [2019-12-27 01:14:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:14:51,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:51,694 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] [2019-12-27 01:14:51,694 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-27 01:14:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:51,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1620503104, now seen corresponding path program 2 times [2019-12-27 01:14:51,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:51,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529596054] [2019-12-27 01:14:51,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:51,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529596054] [2019-12-27 01:14:51,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:51,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:14:51,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055580561] [2019-12-27 01:14:51,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:14:51,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:51,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:14:51,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:14:51,788 INFO L87 Difference]: Start difference. First operand 16461 states and 50424 transitions. Second operand 5 states. [2019-12-27 01:14:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:52,444 INFO L93 Difference]: Finished difference Result 27952 states and 83792 transitions. [2019-12-27 01:14:52,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:14:52,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:14:52,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:52,498 INFO L225 Difference]: With dead ends: 27952 [2019-12-27 01:14:52,498 INFO L226 Difference]: Without dead ends: 27952 [2019-12-27 01:14:52,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:14:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27952 states. [2019-12-27 01:14:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27952 to 22733. [2019-12-27 01:14:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22733 states. [2019-12-27 01:14:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22733 states to 22733 states and 69291 transitions. [2019-12-27 01:14:53,196 INFO L78 Accepts]: Start accepts. Automaton has 22733 states and 69291 transitions. Word has length 40 [2019-12-27 01:14:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:53,197 INFO L462 AbstractCegarLoop]: Abstraction has 22733 states and 69291 transitions. [2019-12-27 01:14:53,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:14:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 22733 states and 69291 transitions. [2019-12-27 01:14:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:14:53,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:53,225 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] [2019-12-27 01:14:53,225 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-27 01:14:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2071452234, now seen corresponding path program 3 times [2019-12-27 01:14:53,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:53,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523631055] [2019-12-27 01:14:53,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:53,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523631055] [2019-12-27 01:14:53,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:53,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:14:53,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881442014] [2019-12-27 01:14:53,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:14:53,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:53,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:14:53,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:14:53,318 INFO L87 Difference]: Start difference. First operand 22733 states and 69291 transitions. Second operand 6 states. [2019-12-27 01:14:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:54,077 INFO L93 Difference]: Finished difference Result 38413 states and 116262 transitions. [2019-12-27 01:14:54,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 01:14:54,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 01:14:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:54,135 INFO L225 Difference]: With dead ends: 38413 [2019-12-27 01:14:54,136 INFO L226 Difference]: Without dead ends: 38413 [2019-12-27 01:14:54,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:14:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38413 states. [2019-12-27 01:14:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38413 to 26717. [2019-12-27 01:14:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26717 states. [2019-12-27 01:14:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26717 states to 26717 states and 81414 transitions. [2019-12-27 01:14:54,638 INFO L78 Accepts]: Start accepts. Automaton has 26717 states and 81414 transitions. Word has length 40 [2019-12-27 01:14:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:54,639 INFO L462 AbstractCegarLoop]: Abstraction has 26717 states and 81414 transitions. [2019-12-27 01:14:54,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:14:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 26717 states and 81414 transitions. [2019-12-27 01:14:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:14:54,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:54,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] [2019-12-27 01:14:54,668 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-27 01:14:54,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:54,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1944149328, now seen corresponding path program 4 times [2019-12-27 01:14:54,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:54,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733459730] [2019-12-27 01:14:54,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:54,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733459730] [2019-12-27 01:14:54,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:54,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:14:54,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963601318] [2019-12-27 01:14:54,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:14:54,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:54,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:14:54,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:14:54,714 INFO L87 Difference]: Start difference. First operand 26717 states and 81414 transitions. Second operand 5 states. [2019-12-27 01:14:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:54,858 INFO L93 Difference]: Finished difference Result 25359 states and 78201 transitions. [2019-12-27 01:14:54,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:14:54,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:14:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:54,914 INFO L225 Difference]: With dead ends: 25359 [2019-12-27 01:14:54,914 INFO L226 Difference]: Without dead ends: 23331 [2019-12-27 01:14:54,915 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-27 01:14:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23331 states. [2019-12-27 01:14:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23331 to 22246. [2019-12-27 01:14:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22246 states. [2019-12-27 01:14:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22246 states to 22246 states and 70322 transitions. [2019-12-27 01:14:55,370 INFO L78 Accepts]: Start accepts. Automaton has 22246 states and 70322 transitions. Word has length 40 [2019-12-27 01:14:55,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:55,370 INFO L462 AbstractCegarLoop]: Abstraction has 22246 states and 70322 transitions. [2019-12-27 01:14:55,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:14:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 22246 states and 70322 transitions. [2019-12-27 01:14:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:14:55,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:55,397 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-27 01:14:55,397 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-27 01:14:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:55,398 INFO L82 PathProgramCache]: Analyzing trace with hash 275512574, now seen corresponding path program 1 times [2019-12-27 01:14:55,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:55,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389726404] [2019-12-27 01:14:55,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:55,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389726404] [2019-12-27 01:14:55,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:55,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:14:55,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405276976] [2019-12-27 01:14:55,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:14:55,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:55,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:14:55,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:14:55,488 INFO L87 Difference]: Start difference. First operand 22246 states and 70322 transitions. Second operand 7 states. [2019-12-27 01:14:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:56,319 INFO L93 Difference]: Finished difference Result 72025 states and 224764 transitions. [2019-12-27 01:14:56,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:14:56,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:14:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:56,397 INFO L225 Difference]: With dead ends: 72025 [2019-12-27 01:14:56,397 INFO L226 Difference]: Without dead ends: 50174 [2019-12-27 01:14:56,397 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-27 01:14:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50174 states. [2019-12-27 01:14:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50174 to 25630. [2019-12-27 01:14:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25630 states. [2019-12-27 01:14:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25630 states to 25630 states and 81003 transitions. [2019-12-27 01:14:56,988 INFO L78 Accepts]: Start accepts. Automaton has 25630 states and 81003 transitions. Word has length 64 [2019-12-27 01:14:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:14:56,988 INFO L462 AbstractCegarLoop]: Abstraction has 25630 states and 81003 transitions. [2019-12-27 01:14:56,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:14:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 25630 states and 81003 transitions. [2019-12-27 01:14:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:14:57,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:14:57,020 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-27 01:14:57,020 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-27 01:14:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:14:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash 474826606, now seen corresponding path program 2 times [2019-12-27 01:14:57,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:14:57,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926462714] [2019-12-27 01:14:57,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:14:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:14:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:14:57,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926462714] [2019-12-27 01:14:57,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:14:57,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:14:57,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35099567] [2019-12-27 01:14:57,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:14:57,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:14:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:14:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:14:57,125 INFO L87 Difference]: Start difference. First operand 25630 states and 81003 transitions. Second operand 8 states. [2019-12-27 01:14:59,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:14:59,082 INFO L93 Difference]: Finished difference Result 121805 states and 379916 transitions. [2019-12-27 01:14:59,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:14:59,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 01:14:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:14:59,271 INFO L225 Difference]: With dead ends: 121805 [2019-12-27 01:14:59,271 INFO L226 Difference]: Without dead ends: 83754 [2019-12-27 01:14:59,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:14:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83754 states. [2019-12-27 01:15:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83754 to 29901. [2019-12-27 01:15:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29901 states. [2019-12-27 01:15:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29901 states to 29901 states and 94342 transitions. [2019-12-27 01:15:01,479 INFO L78 Accepts]: Start accepts. Automaton has 29901 states and 94342 transitions. Word has length 64 [2019-12-27 01:15:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:01,479 INFO L462 AbstractCegarLoop]: Abstraction has 29901 states and 94342 transitions. [2019-12-27 01:15:01,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:15:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 29901 states and 94342 transitions. [2019-12-27 01:15:01,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:15:01,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:01,513 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-27 01:15:01,513 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-27 01:15:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:01,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1554423936, now seen corresponding path program 3 times [2019-12-27 01:15:01,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:01,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119896132] [2019-12-27 01:15:01,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:01,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119896132] [2019-12-27 01:15:01,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:01,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:15:01,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616287221] [2019-12-27 01:15:01,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:15:01,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:01,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:15:01,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:15:01,643 INFO L87 Difference]: Start difference. First operand 29901 states and 94342 transitions. Second operand 9 states. [2019-12-27 01:15:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:03,709 INFO L93 Difference]: Finished difference Result 183880 states and 570924 transitions. [2019-12-27 01:15:03,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 01:15:03,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:15:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:03,957 INFO L225 Difference]: With dead ends: 183880 [2019-12-27 01:15:03,957 INFO L226 Difference]: Without dead ends: 147650 [2019-12-27 01:15:03,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 01:15:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147650 states. [2019-12-27 01:15:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147650 to 36955. [2019-12-27 01:15:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36955 states. [2019-12-27 01:15:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36955 states to 36955 states and 116388 transitions. [2019-12-27 01:15:05,930 INFO L78 Accepts]: Start accepts. Automaton has 36955 states and 116388 transitions. Word has length 64 [2019-12-27 01:15:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:05,931 INFO L462 AbstractCegarLoop]: Abstraction has 36955 states and 116388 transitions. [2019-12-27 01:15:05,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:15:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 36955 states and 116388 transitions. [2019-12-27 01:15:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:15:05,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:05,973 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-27 01:15:05,973 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-27 01:15:05,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:05,974 INFO L82 PathProgramCache]: Analyzing trace with hash 85476954, now seen corresponding path program 4 times [2019-12-27 01:15:05,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:05,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557915821] [2019-12-27 01:15:05,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:06,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557915821] [2019-12-27 01:15:06,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:06,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:15:06,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334273791] [2019-12-27 01:15:06,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:15:06,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:06,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:15:06,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:15:06,102 INFO L87 Difference]: Start difference. First operand 36955 states and 116388 transitions. Second operand 9 states. [2019-12-27 01:15:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:08,518 INFO L93 Difference]: Finished difference Result 152885 states and 470048 transitions. [2019-12-27 01:15:08,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 01:15:08,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:15:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:08,723 INFO L225 Difference]: With dead ends: 152885 [2019-12-27 01:15:08,723 INFO L226 Difference]: Without dead ends: 136778 [2019-12-27 01:15:08,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 01:15:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136778 states. [2019-12-27 01:15:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136778 to 36142. [2019-12-27 01:15:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36142 states. [2019-12-27 01:15:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36142 states to 36142 states and 113529 transitions. [2019-12-27 01:15:10,021 INFO L78 Accepts]: Start accepts. Automaton has 36142 states and 113529 transitions. Word has length 64 [2019-12-27 01:15:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:10,021 INFO L462 AbstractCegarLoop]: Abstraction has 36142 states and 113529 transitions. [2019-12-27 01:15:10,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:15:10,021 INFO L276 IsEmpty]: Start isEmpty. Operand 36142 states and 113529 transitions. [2019-12-27 01:15:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:15:10,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:10,064 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-27 01:15:10,065 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-27 01:15:10,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash 812479892, now seen corresponding path program 5 times [2019-12-27 01:15:10,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:10,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909646638] [2019-12-27 01:15:10,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:10,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-27 01:15:10,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909646638] [2019-12-27 01:15:10,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:10,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:15:10,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884143329] [2019-12-27 01:15:10,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:15:10,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:10,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:15:10,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:15:10,150 INFO L87 Difference]: Start difference. First operand 36142 states and 113529 transitions. Second operand 7 states. [2019-12-27 01:15:10,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:10,763 INFO L93 Difference]: Finished difference Result 78673 states and 242006 transitions. [2019-12-27 01:15:10,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:15:10,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:15:10,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:10,909 INFO L225 Difference]: With dead ends: 78673 [2019-12-27 01:15:10,909 INFO L226 Difference]: Without dead ends: 67651 [2019-12-27 01:15:10,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:15:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67651 states. [2019-12-27 01:15:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67651 to 36206. [2019-12-27 01:15:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36206 states. [2019-12-27 01:15:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36206 states to 36206 states and 113658 transitions. [2019-12-27 01:15:12,154 INFO L78 Accepts]: Start accepts. Automaton has 36206 states and 113658 transitions. Word has length 64 [2019-12-27 01:15:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:12,154 INFO L462 AbstractCegarLoop]: Abstraction has 36206 states and 113658 transitions. [2019-12-27 01:15:12,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:15:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 36206 states and 113658 transitions. [2019-12-27 01:15:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:15:12,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:12,198 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-27 01:15:12,198 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-27 01:15:12,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:12,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1442601312, now seen corresponding path program 6 times [2019-12-27 01:15:12,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:12,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003042850] [2019-12-27 01:15:12,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:12,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003042850] [2019-12-27 01:15:12,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:12,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:15:12,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306261601] [2019-12-27 01:15:12,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:15:12,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:12,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:15:12,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:12,266 INFO L87 Difference]: Start difference. First operand 36206 states and 113658 transitions. Second operand 3 states. [2019-12-27 01:15:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:12,448 INFO L93 Difference]: Finished difference Result 43673 states and 135917 transitions. [2019-12-27 01:15:12,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:15:12,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:15:12,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:12,513 INFO L225 Difference]: With dead ends: 43673 [2019-12-27 01:15:12,513 INFO L226 Difference]: Without dead ends: 43673 [2019-12-27 01:15:12,513 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-27 01:15:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43673 states. [2019-12-27 01:15:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43673 to 37805. [2019-12-27 01:15:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37805 states. [2019-12-27 01:15:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37805 states to 37805 states and 118379 transitions. [2019-12-27 01:15:13,160 INFO L78 Accepts]: Start accepts. Automaton has 37805 states and 118379 transitions. Word has length 64 [2019-12-27 01:15:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:13,160 INFO L462 AbstractCegarLoop]: Abstraction has 37805 states and 118379 transitions. [2019-12-27 01:15:13,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:15:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 37805 states and 118379 transitions. [2019-12-27 01:15:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:15:13,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:13,205 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-27 01:15:13,206 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-27 01:15:13,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:13,206 INFO L82 PathProgramCache]: Analyzing trace with hash 318332456, now seen corresponding path program 1 times [2019-12-27 01:15:13,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:13,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125140465] [2019-12-27 01:15:13,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:13,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125140465] [2019-12-27 01:15:13,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:13,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:15:13,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457972895] [2019-12-27 01:15:13,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:15:13,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:13,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:15:13,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:15:13,303 INFO L87 Difference]: Start difference. First operand 37805 states and 118379 transitions. Second operand 8 states. [2019-12-27 01:15:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:14,936 INFO L93 Difference]: Finished difference Result 110886 states and 342679 transitions. [2019-12-27 01:15:14,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:15:14,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 01:15:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:15,104 INFO L225 Difference]: With dead ends: 110886 [2019-12-27 01:15:15,104 INFO L226 Difference]: Without dead ends: 104510 [2019-12-27 01:15:15,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:15:15,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104510 states. [2019-12-27 01:15:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104510 to 38340. [2019-12-27 01:15:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38340 states. [2019-12-27 01:15:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38340 states to 38340 states and 120322 transitions. [2019-12-27 01:15:16,264 INFO L78 Accepts]: Start accepts. Automaton has 38340 states and 120322 transitions. Word has length 65 [2019-12-27 01:15:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:16,264 INFO L462 AbstractCegarLoop]: Abstraction has 38340 states and 120322 transitions. [2019-12-27 01:15:16,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:15:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 38340 states and 120322 transitions. [2019-12-27 01:15:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:15:16,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:16,310 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-27 01:15:16,311 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-27 01:15:16,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:16,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1590918528, now seen corresponding path program 2 times [2019-12-27 01:15:16,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:16,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802734466] [2019-12-27 01:15:16,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:16,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802734466] [2019-12-27 01:15:16,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:16,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:15:16,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892283854] [2019-12-27 01:15:16,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:15:16,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:16,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:15:16,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:15:16,451 INFO L87 Difference]: Start difference. First operand 38340 states and 120322 transitions. Second operand 9 states. [2019-12-27 01:15:18,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:18,764 INFO L93 Difference]: Finished difference Result 163120 states and 501153 transitions. [2019-12-27 01:15:18,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 01:15:18,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:15:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:18,977 INFO L225 Difference]: With dead ends: 163120 [2019-12-27 01:15:18,978 INFO L226 Difference]: Without dead ends: 134485 [2019-12-27 01:15:18,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 01:15:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134485 states. [2019-12-27 01:15:20,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134485 to 40212. [2019-12-27 01:15:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40212 states. [2019-12-27 01:15:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40212 states to 40212 states and 125303 transitions. [2019-12-27 01:15:20,361 INFO L78 Accepts]: Start accepts. Automaton has 40212 states and 125303 transitions. Word has length 65 [2019-12-27 01:15:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:20,361 INFO L462 AbstractCegarLoop]: Abstraction has 40212 states and 125303 transitions. [2019-12-27 01:15:20,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:15:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 40212 states and 125303 transitions. [2019-12-27 01:15:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:15:20,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:20,407 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-27 01:15:20,407 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-27 01:15:20,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:20,407 INFO L82 PathProgramCache]: Analyzing trace with hash 704301340, now seen corresponding path program 3 times [2019-12-27 01:15:20,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:20,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106972437] [2019-12-27 01:15:20,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:20,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106972437] [2019-12-27 01:15:20,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:20,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:15:20,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244748921] [2019-12-27 01:15:20,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:15:20,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:20,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:15:20,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:15:20,509 INFO L87 Difference]: Start difference. First operand 40212 states and 125303 transitions. Second operand 9 states. [2019-12-27 01:15:22,000 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-27 01:15:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:22,477 INFO L93 Difference]: Finished difference Result 132812 states and 405190 transitions. [2019-12-27 01:15:22,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:15:22,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:15:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:22,671 INFO L225 Difference]: With dead ends: 132812 [2019-12-27 01:15:22,672 INFO L226 Difference]: Without dead ends: 124029 [2019-12-27 01:15:22,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-27 01:15:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124029 states. [2019-12-27 01:15:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124029 to 38469. [2019-12-27 01:15:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38469 states. [2019-12-27 01:15:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38469 states to 38469 states and 120398 transitions. [2019-12-27 01:15:24,027 INFO L78 Accepts]: Start accepts. Automaton has 38469 states and 120398 transitions. Word has length 65 [2019-12-27 01:15:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:24,027 INFO L462 AbstractCegarLoop]: Abstraction has 38469 states and 120398 transitions. [2019-12-27 01:15:24,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:15:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 38469 states and 120398 transitions. [2019-12-27 01:15:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:15:24,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:24,071 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-27 01:15:24,072 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-27 01:15:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:24,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1422061222, now seen corresponding path program 1 times [2019-12-27 01:15:24,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:24,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161139768] [2019-12-27 01:15:24,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:24,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161139768] [2019-12-27 01:15:24,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:24,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:15:24,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454411926] [2019-12-27 01:15:24,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:15:24,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:24,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:15:24,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:15:24,187 INFO L87 Difference]: Start difference. First operand 38469 states and 120398 transitions. Second operand 7 states. [2019-12-27 01:15:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:26,185 INFO L93 Difference]: Finished difference Result 72617 states and 222939 transitions. [2019-12-27 01:15:26,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:15:26,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 01:15:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:26,298 INFO L225 Difference]: With dead ends: 72617 [2019-12-27 01:15:26,298 INFO L226 Difference]: Without dead ends: 72617 [2019-12-27 01:15:26,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:15:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72617 states. [2019-12-27 01:15:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72617 to 39272. [2019-12-27 01:15:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39272 states. [2019-12-27 01:15:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39272 states to 39272 states and 122780 transitions. [2019-12-27 01:15:27,176 INFO L78 Accepts]: Start accepts. Automaton has 39272 states and 122780 transitions. Word has length 65 [2019-12-27 01:15:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:27,176 INFO L462 AbstractCegarLoop]: Abstraction has 39272 states and 122780 transitions. [2019-12-27 01:15:27,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:15:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 39272 states and 122780 transitions. [2019-12-27 01:15:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:15:27,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:27,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] [2019-12-27 01:15:27,223 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-27 01:15:27,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:27,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1551355630, now seen corresponding path program 4 times [2019-12-27 01:15:27,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:27,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865286288] [2019-12-27 01:15:27,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:27,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865286288] [2019-12-27 01:15:27,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:27,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:15:27,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862775458] [2019-12-27 01:15:27,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:15:27,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:27,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:15:27,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:15:27,318 INFO L87 Difference]: Start difference. First operand 39272 states and 122780 transitions. Second operand 7 states. [2019-12-27 01:15:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:28,833 INFO L93 Difference]: Finished difference Result 71507 states and 217949 transitions. [2019-12-27 01:15:28,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:15:28,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 01:15:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:28,944 INFO L225 Difference]: With dead ends: 71507 [2019-12-27 01:15:28,944 INFO L226 Difference]: Without dead ends: 71507 [2019-12-27 01:15:28,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:15:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71507 states. [2019-12-27 01:15:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71507 to 40699. [2019-12-27 01:15:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40699 states. [2019-12-27 01:15:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40699 states to 40699 states and 126651 transitions. [2019-12-27 01:15:30,145 INFO L78 Accepts]: Start accepts. Automaton has 40699 states and 126651 transitions. Word has length 65 [2019-12-27 01:15:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:30,145 INFO L462 AbstractCegarLoop]: Abstraction has 40699 states and 126651 transitions. [2019-12-27 01:15:30,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:15:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 40699 states and 126651 transitions. [2019-12-27 01:15:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:15:30,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:30,194 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-27 01:15:30,194 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-27 01:15:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:30,194 INFO L82 PathProgramCache]: Analyzing trace with hash 372067404, now seen corresponding path program 2 times [2019-12-27 01:15:30,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:30,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314362856] [2019-12-27 01:15:30,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:30,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-27 01:15:30,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314362856] [2019-12-27 01:15:30,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:30,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:15:30,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209500803] [2019-12-27 01:15:30,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:15:30,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:30,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:15:30,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:15:30,334 INFO L87 Difference]: Start difference. First operand 40699 states and 126651 transitions. Second operand 8 states. [2019-12-27 01:15:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:32,131 INFO L93 Difference]: Finished difference Result 83238 states and 255936 transitions. [2019-12-27 01:15:32,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:15:32,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 01:15:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:32,262 INFO L225 Difference]: With dead ends: 83238 [2019-12-27 01:15:32,262 INFO L226 Difference]: Without dead ends: 83238 [2019-12-27 01:15:32,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:15:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83238 states. [2019-12-27 01:15:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83238 to 43093. [2019-12-27 01:15:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43093 states. [2019-12-27 01:15:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43093 states to 43093 states and 135136 transitions. [2019-12-27 01:15:33,308 INFO L78 Accepts]: Start accepts. Automaton has 43093 states and 135136 transitions. Word has length 65 [2019-12-27 01:15:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:33,308 INFO L462 AbstractCegarLoop]: Abstraction has 43093 states and 135136 transitions. [2019-12-27 01:15:33,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:15:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 43093 states and 135136 transitions. [2019-12-27 01:15:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:15:33,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:33,359 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-27 01:15:33,359 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-27 01:15:33,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 140793632, now seen corresponding path program 3 times [2019-12-27 01:15:33,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:33,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883440696] [2019-12-27 01:15:33,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:33,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-27 01:15:33,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883440696] [2019-12-27 01:15:33,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:33,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:15:33,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14546601] [2019-12-27 01:15:33,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:15:33,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:33,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:15:33,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:33,403 INFO L87 Difference]: Start difference. First operand 43093 states and 135136 transitions. Second operand 3 states. [2019-12-27 01:15:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:33,567 INFO L93 Difference]: Finished difference Result 30408 states and 94958 transitions. [2019-12-27 01:15:33,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:15:33,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:15:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:33,641 INFO L225 Difference]: With dead ends: 30408 [2019-12-27 01:15:33,641 INFO L226 Difference]: Without dead ends: 30408 [2019-12-27 01:15:33,645 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-27 01:15:34,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30408 states. [2019-12-27 01:15:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30408 to 28380. [2019-12-27 01:15:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28380 states. [2019-12-27 01:15:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28380 states to 28380 states and 88290 transitions. [2019-12-27 01:15:34,623 INFO L78 Accepts]: Start accepts. Automaton has 28380 states and 88290 transitions. Word has length 65 [2019-12-27 01:15:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:34,623 INFO L462 AbstractCegarLoop]: Abstraction has 28380 states and 88290 transitions. [2019-12-27 01:15:34,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:15:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 28380 states and 88290 transitions. [2019-12-27 01:15:34,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:15:34,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:34,680 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-27 01:15:34,680 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-27 01:15:34,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:34,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1442275055, now seen corresponding path program 1 times [2019-12-27 01:15:34,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:34,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172565726] [2019-12-27 01:15:34,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:35,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172565726] [2019-12-27 01:15:35,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:35,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 01:15:35,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915216179] [2019-12-27 01:15:35,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 01:15:35,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:35,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 01:15:35,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:15:35,189 INFO L87 Difference]: Start difference. First operand 28380 states and 88290 transitions. Second operand 16 states. [2019-12-27 01:15:44,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:44,297 INFO L93 Difference]: Finished difference Result 82787 states and 251253 transitions. [2019-12-27 01:15:44,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-12-27 01:15:44,297 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 01:15:44,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:44,414 INFO L225 Difference]: With dead ends: 82787 [2019-12-27 01:15:44,414 INFO L226 Difference]: Without dead ends: 82619 [2019-12-27 01:15:44,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2617 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1395, Invalid=6261, Unknown=0, NotChecked=0, Total=7656 [2019-12-27 01:15:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82619 states. [2019-12-27 01:15:45,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82619 to 36072. [2019-12-27 01:15:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36072 states. [2019-12-27 01:15:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36072 states to 36072 states and 113058 transitions. [2019-12-27 01:15:45,384 INFO L78 Accepts]: Start accepts. Automaton has 36072 states and 113058 transitions. Word has length 66 [2019-12-27 01:15:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:45,384 INFO L462 AbstractCegarLoop]: Abstraction has 36072 states and 113058 transitions. [2019-12-27 01:15:45,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 01:15:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 36072 states and 113058 transitions. [2019-12-27 01:15:45,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:15:45,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:45,425 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-27 01:15:45,426 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:15:45,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:45,426 INFO L82 PathProgramCache]: Analyzing trace with hash -544773579, now seen corresponding path program 2 times [2019-12-27 01:15:45,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:45,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829361942] [2019-12-27 01:15:45,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:15:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:15:45,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829361942] [2019-12-27 01:15:45,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:15:45,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:15:45,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376936380] [2019-12-27 01:15:45,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:15:45,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:15:45,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:15:45,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:15:45,492 INFO L87 Difference]: Start difference. First operand 36072 states and 113058 transitions. Second operand 3 states. [2019-12-27 01:15:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:15:45,713 INFO L93 Difference]: Finished difference Result 36072 states and 113057 transitions. [2019-12-27 01:15:45,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:15:45,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:15:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:15:45,815 INFO L225 Difference]: With dead ends: 36072 [2019-12-27 01:15:45,815 INFO L226 Difference]: Without dead ends: 36072 [2019-12-27 01:15:45,815 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-27 01:15:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36072 states. [2019-12-27 01:15:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36072 to 22912. [2019-12-27 01:15:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22912 states. [2019-12-27 01:15:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22912 states to 22912 states and 71967 transitions. [2019-12-27 01:15:46,586 INFO L78 Accepts]: Start accepts. Automaton has 22912 states and 71967 transitions. Word has length 66 [2019-12-27 01:15:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:15:46,586 INFO L462 AbstractCegarLoop]: Abstraction has 22912 states and 71967 transitions. [2019-12-27 01:15:46,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:15:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 22912 states and 71967 transitions. [2019-12-27 01:15:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:15:46,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:15:46,615 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-27 01:15:46,615 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:15:46,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:15:46,615 INFO L82 PathProgramCache]: Analyzing trace with hash 763340387, now seen corresponding path program 1 times [2019-12-27 01:15:46,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:15:46,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051868847] [2019-12-27 01:15:46,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:15:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:15:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:15:46,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:15:46,748 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:15:46,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~z$r_buff0_thd3~0_367) (= v_~z$r_buff0_thd0~0_147 0) (= v_~z$w_buff0_used~0_850 0) (= v_~z$w_buff0~0_393 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_322) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t153~0.base_27| 4) |v_#length_23|) (= v_~weak$$choice2~0_147 0) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_168 0) (= |v_ULTIMATE.start_main_~#t153~0.offset_17| 0) (= v_~z$w_buff1_used~0_568 0) (= v_~main$tmp_guard1~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_41) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t153~0.base_27| 1) |v_#valid_73|) (= 0 v_~z$flush_delayed~0_26) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~z$r_buff0_thd1~0_210 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t153~0.base_27|) 0) (= 0 v_~x~0_154) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t153~0.base_27|) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_27|) |v_ULTIMATE.start_main_~#t153~0.offset_17| 0)) |v_#memory_int_19|) (= v_~y~0_31 0) (= v_~z$r_buff1_thd0~0_191 0) (= v_~z$w_buff1~0_253 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_168, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_61|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_191|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t153~0.base=|v_ULTIMATE.start_main_~#t153~0.base_27|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_568, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_158, ~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_367, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x~0=v_~x~0_154, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_22|, ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_253, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_39|, ~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_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_191, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_129, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_850, ~z$w_buff0~0=v_~z$w_buff0~0_393, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_322, ULTIMATE.start_main_~#t153~0.offset=|v_ULTIMATE.start_main_~#t153~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t154~0.offset, ~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_p1_EAX~0, ULTIMATE.start_main_~#t153~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t155~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t154~0.base, ULTIMATE.start_main_~#t155~0.base, ~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, ~__unbuffered_p1_EBX~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, ULTIMATE.start_main_~#t153~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:15:46,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L830-1-->L832: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t154~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t154~0.offset_9| 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t154~0.base_11| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t154~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t154~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t154~0.base_11|) |v_ULTIMATE.start_main_~#t154~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t154~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t154~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t154~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t154~0.base] because there is no mapped edge [2019-12-27 01:15:46,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_13) (= 1 v_~x~0_6) (= v_~z$r_buff0_thd1~0_21 1) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_31) (= v_~z$r_buff0_thd1~0_22 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_31, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_13, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~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, ~x~0] because there is no mapped edge [2019-12-27 01:15:46,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In1895913673 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1895913673 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1895913673| ~z$w_buff1~0_In1895913673) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1895913673| ~z~0_In1895913673)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1895913673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1895913673, ~z$w_buff1~0=~z$w_buff1~0_In1895913673, ~z~0=~z~0_In1895913673} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1895913673|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1895913673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1895913673, ~z$w_buff1~0=~z$w_buff1~0_In1895913673, ~z~0=~z~0_In1895913673} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 01:15:46,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~z~0_27) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_17|, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 01:15:46,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In2141346002 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2141346002 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out2141346002|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In2141346002 |P1Thread1of1ForFork2_#t~ite11_Out2141346002|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2141346002, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2141346002} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2141346002, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out2141346002|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2141346002} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:15:46,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In2062263137 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In2062263137 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2062263137 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In2062263137 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out2062263137|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In2062263137 |P1Thread1of1ForFork2_#t~ite12_Out2062263137|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2062263137, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2062263137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2062263137, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2062263137} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2062263137, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2062263137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2062263137, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out2062263137|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2062263137} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:15:46,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t155~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t155~0.base_9|) |v_ULTIMATE.start_main_~#t155~0.offset_8| 2)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t155~0.offset_8| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t155~0.base_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t155~0.base_9| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t155~0.base_9| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t155~0.base_9| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t155~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_8|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t155~0.base, ULTIMATE.start_main_~#t155~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 01:15:46,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-135580956 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In-135580956| |P2Thread1of1ForFork0_#t~ite20_Out-135580956|) (= ~z$w_buff0~0_In-135580956 |P2Thread1of1ForFork0_#t~ite21_Out-135580956|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-135580956 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-135580956 256))) (= 0 (mod ~z$w_buff0_used~0_In-135580956 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-135580956 256))))) (= |P2Thread1of1ForFork0_#t~ite20_Out-135580956| ~z$w_buff0~0_In-135580956) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-135580956| |P2Thread1of1ForFork0_#t~ite21_Out-135580956|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-135580956, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-135580956, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-135580956, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-135580956, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-135580956, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-135580956|, ~weak$$choice2~0=~weak$$choice2~0_In-135580956} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-135580956|, ~z$w_buff0~0=~z$w_buff0~0_In-135580956, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-135580956, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-135580956, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-135580956, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-135580956, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-135580956|, ~weak$$choice2~0=~weak$$choice2~0_In-135580956} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 01:15:46,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1108686907 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1108686907 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1108686907 |P1Thread1of1ForFork2_#t~ite13_Out1108686907|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1108686907|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1108686907, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1108686907} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1108686907, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1108686907|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1108686907} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:15:46,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1520239143 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1520239143 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In1520239143 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1520239143 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out1520239143| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out1520239143| ~z$r_buff1_thd2~0_In1520239143) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1520239143, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1520239143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1520239143, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1520239143} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1520239143, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1520239143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1520239143, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1520239143|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1520239143} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:15:46,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L775-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork2_#t~ite14_32| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, 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-27 01:15:46,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1378987708 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-1378987708| |P2Thread1of1ForFork0_#t~ite23_Out-1378987708|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1378987708 256)))) (or (= (mod ~z$w_buff0_used~0_In-1378987708 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1378987708 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1378987708 256) 0)))) (= ~z$w_buff1~0_In-1378987708 |P2Thread1of1ForFork0_#t~ite23_Out-1378987708|)) (and (not .cse0) (= ~z$w_buff1~0_In-1378987708 |P2Thread1of1ForFork0_#t~ite24_Out-1378987708|) (= |P2Thread1of1ForFork0_#t~ite23_In-1378987708| |P2Thread1of1ForFork0_#t~ite23_Out-1378987708|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1378987708, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1378987708, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1378987708|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1378987708, ~z$w_buff1~0=~z$w_buff1~0_In-1378987708, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1378987708, ~weak$$choice2~0=~weak$$choice2~0_In-1378987708} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1378987708, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1378987708|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1378987708, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1378987708|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1378987708, ~z$w_buff1~0=~z$w_buff1~0_In-1378987708, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1378987708, ~weak$$choice2~0=~weak$$choice2~0_In-1378987708} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 01:15:46,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In96228061 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In96228061| |P2Thread1of1ForFork0_#t~ite26_Out96228061|) (= |P2Thread1of1ForFork0_#t~ite27_Out96228061| ~z$w_buff0_used~0_In96228061)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out96228061| |P2Thread1of1ForFork0_#t~ite26_Out96228061|) (= ~z$w_buff0_used~0_In96228061 |P2Thread1of1ForFork0_#t~ite26_Out96228061|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In96228061 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In96228061 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In96228061 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In96228061 256))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In96228061|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In96228061, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In96228061, ~z$w_buff1_used~0=~z$w_buff1_used~0_In96228061, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In96228061, ~weak$$choice2~0=~weak$$choice2~0_In96228061} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out96228061|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out96228061|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In96228061, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In96228061, ~z$w_buff1_used~0=~z$w_buff1_used~0_In96228061, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In96228061, ~weak$$choice2~0=~weak$$choice2~0_In96228061} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 01:15:46,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff0_thd3~0_66)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_16} 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_66, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:15:46,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= v_~z~0_50 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~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-27 01:15:46,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In640236180 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In640236180 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out640236180| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In640236180 |P0Thread1of1ForFork1_#t~ite5_Out640236180|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In640236180, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In640236180} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out640236180|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In640236180, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In640236180} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:15:46,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-599295960 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-599295960 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-599295960| ~z$w_buff1~0_In-599295960) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-599295960| ~z~0_In-599295960) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-599295960, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-599295960, ~z$w_buff1~0=~z$w_buff1~0_In-599295960, ~z~0=~z~0_In-599295960} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-599295960|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-599295960, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-599295960, ~z$w_buff1~0=~z$w_buff1~0_In-599295960, ~z~0=~z~0_In-599295960} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:15:46,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In-1710124203 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1710124203 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1710124203 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1710124203 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1710124203|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-1710124203| ~z$w_buff1_used~0_In-1710124203)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1710124203, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1710124203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1710124203, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1710124203} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1710124203, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1710124203|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1710124203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1710124203, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1710124203} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:15:46,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1253652874 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1253652874 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1253652874 ~z$r_buff0_thd1~0_In1253652874)) (and (= 0 ~z$r_buff0_thd1~0_Out1253652874) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1253652874, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1253652874} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1253652874, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1253652874|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1253652874} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:15:46,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1455688333 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1455688333 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1455688333 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1455688333 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1455688333| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out1455688333| ~z$r_buff1_thd1~0_In1455688333)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1455688333, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1455688333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1455688333, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1455688333} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1455688333|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1455688333, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1455688333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1455688333, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1455688333} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:15:46,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} 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-27 01:15:46,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 01:15:46,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-430585608 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-430585608 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-430585608|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-430585608 |P2Thread1of1ForFork0_#t~ite40_Out-430585608|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-430585608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-430585608} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-430585608, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-430585608|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-430585608} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:15:46,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1568659912 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1568659912 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1568659912 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1568659912 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-1568659912| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite41_Out-1568659912| ~z$w_buff1_used~0_In-1568659912)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1568659912, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1568659912, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1568659912, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1568659912} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1568659912, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1568659912, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1568659912, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1568659912, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1568659912|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:15:46,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-46144599 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-46144599 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-46144599| ~z$r_buff0_thd3~0_In-46144599)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-46144599|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-46144599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-46144599} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-46144599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-46144599, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-46144599|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:15:46,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1042847082 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1042847082 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1042847082 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1042847082 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out-1042847082| ~z$r_buff1_thd3~0_In-1042847082) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1042847082| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1042847082, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1042847082, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1042847082, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1042847082} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1042847082|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1042847082, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1042847082, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1042847082, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1042847082} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:15:46,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_121 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} 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_121, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, 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-27 01:15:46,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:15:46,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-442458| |ULTIMATE.start_main_#t~ite48_Out-442458|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-442458 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-442458 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-442458| ~z~0_In-442458)) (and .cse0 (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-442458| ~z$w_buff1~0_In-442458)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-442458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-442458, ~z$w_buff1~0=~z$w_buff1~0_In-442458, ~z~0=~z~0_In-442458} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-442458, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-442458|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-442458, ~z$w_buff1~0=~z$w_buff1~0_In-442458, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-442458|, ~z~0=~z~0_In-442458} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:15:46,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1548015825 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1548015825 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1548015825 |ULTIMATE.start_main_#t~ite49_Out-1548015825|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1548015825| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1548015825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1548015825} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1548015825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1548015825, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1548015825|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:15:46,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2060771251 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-2060771251 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-2060771251 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2060771251 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-2060771251| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite50_Out-2060771251| ~z$w_buff1_used~0_In-2060771251)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2060771251, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2060771251, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2060771251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2060771251} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2060771251|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2060771251, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2060771251, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2060771251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2060771251} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:15:46,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-763918699 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-763918699 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-763918699|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-763918699 |ULTIMATE.start_main_#t~ite51_Out-763918699|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-763918699, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-763918699} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-763918699, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-763918699|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-763918699} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:15:46,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-219387632 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-219387632 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-219387632 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-219387632 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-219387632| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-219387632| ~z$r_buff1_thd0~0_In-219387632) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-219387632, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-219387632, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-219387632, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-219387632} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-219387632|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-219387632, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-219387632, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-219387632, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-219387632} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:15:46,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 2 v_~__unbuffered_p1_EAX~0_22) (= v_~x~0_65 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= v_~z$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~__unbuffered_p1_EBX~0_23 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65, 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-27 01:15:46,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:15:46 BasicIcfg [2019-12-27 01:15:46,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:15:46,892 INFO L168 Benchmark]: Toolchain (without parser) took 137019.87 ms. Allocated memory was 146.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 102.7 MB in the beginning and 1.0 GB in the end (delta: -900.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 01:15:46,892 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 01:15:46,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 854.74 ms. Allocated memory was 146.3 MB in the beginning and 206.0 MB in the end (delta: 59.8 MB). Free memory was 102.3 MB in the beginning and 157.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:15:46,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.28 ms. Allocated memory is still 206.0 MB. Free memory was 157.0 MB in the beginning and 155.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:15:46,893 INFO L168 Benchmark]: Boogie Preprocessor took 40.63 ms. Allocated memory is still 206.0 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:15:46,897 INFO L168 Benchmark]: RCFGBuilder took 879.25 ms. Allocated memory is still 206.0 MB. Free memory was 152.3 MB in the beginning and 101.3 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:15:46,898 INFO L168 Benchmark]: TraceAbstraction took 135176.15 ms. Allocated memory was 206.0 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.3 MB in the beginning and 1.0 GB in the end (delta: -901.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 01:15:46,900 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.48 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 854.74 ms. Allocated memory was 146.3 MB in the beginning and 206.0 MB in the end (delta: 59.8 MB). Free memory was 102.3 MB in the beginning and 157.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.28 ms. Allocated memory is still 206.0 MB. Free memory was 157.0 MB in the beginning and 155.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.63 ms. Allocated memory is still 206.0 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 879.25 ms. Allocated memory is still 206.0 MB. Free memory was 152.3 MB in the beginning and 101.3 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 135176.15 ms. Allocated memory was 206.0 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.3 MB in the beginning and 1.0 GB in the end (delta: -901.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7398 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 270 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78628 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L832] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=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] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L771] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, 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] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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] [L795] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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] [L795] 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) [L796] 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)) [L773] 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 [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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] [L797] 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)) [L798] 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)) [L799] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, 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=2, y=1, z=0, z$flush_delayed=1, 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] [L799] 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)) [L801] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, 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=2, y=1, z=0, z$flush_delayed=1, 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] [L801] 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)) [L802] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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] [L748] 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) [L807] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 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 [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 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 [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, 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] [L840] 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) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 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 [L843] 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, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 134.8s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 55.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8661 SDtfs, 15377 SDslu, 26274 SDs, 0 SdLazy, 18418 SolverSat, 1168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 75 SyntacticMatches, 22 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4699 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146095occurred 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: 51.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 977771 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1516 NumberOfCodeBlocks, 1516 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 288327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...