/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/safe005_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:31:42,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:31:42,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:31:42,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:31:42,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:31:42,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:31:42,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:31:42,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:31:42,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:31:42,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:31:42,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:31:42,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:31:42,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:31:42,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:31:42,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:31:42,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:31:42,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:31:42,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:31:42,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:31:42,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:31:42,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:31:42,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:31:42,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:31:42,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:31:42,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:31:42,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:31:42,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:31:42,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:31:42,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:31:42,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:31:42,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:31:42,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:31:42,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:31:42,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:31:42,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:31:42,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:31:42,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:31:42,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:31:42,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:31:42,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:31:42,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:31:42,624 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 03:31:42,644 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:31:42,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:31:42,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:31:42,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:31:42,647 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:31:42,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:31:42,648 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:31:42,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:31:42,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:31:42,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:31:42,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:31:42,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:31:42,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:31:42,651 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:31:42,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:31:42,651 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:31:42,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:31:42,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:31:42,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:31:42,652 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:31:42,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:31:42,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:31:42,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:31:42,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:31:42,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:31:42,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:31:42,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:31:42,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:31:42,654 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:31:42,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:31:42,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:31:42,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:31:42,947 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:31:42,947 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:31:42,948 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2019-12-27 03:31:43,022 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e83b7235/304282c3a1354860bb257990ebac5668/FLAG79e8f0385 [2019-12-27 03:31:43,618 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:31:43,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2019-12-27 03:31:43,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e83b7235/304282c3a1354860bb257990ebac5668/FLAG79e8f0385 [2019-12-27 03:31:43,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e83b7235/304282c3a1354860bb257990ebac5668 [2019-12-27 03:31:43,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:31:43,854 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:31:43,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:31:43,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:31:43,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:31:43,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:31:43" (1/1) ... [2019-12-27 03:31:43,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71599c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:43, skipping insertion in model container [2019-12-27 03:31:43,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:31:43" (1/1) ... [2019-12-27 03:31:43,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:31:43,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:31:44,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:31:44,492 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:31:44,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:31:44,629 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:31:44,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:44 WrapperNode [2019-12-27 03:31:44,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:31:44,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:31:44,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:31:44,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:31:44,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:44" (1/1) ... [2019-12-27 03:31:44,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:44" (1/1) ... [2019-12-27 03:31:44,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:31:44,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:31:44,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:31:44,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:31:44,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:44" (1/1) ... [2019-12-27 03:31:44,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:44" (1/1) ... [2019-12-27 03:31:44,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:44" (1/1) ... [2019-12-27 03:31:44,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:44" (1/1) ... [2019-12-27 03:31:44,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:44" (1/1) ... [2019-12-27 03:31:44,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:44" (1/1) ... [2019-12-27 03:31:44,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:44" (1/1) ... [2019-12-27 03:31:44,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:31:44,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:31:44,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:31:44,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:31:44,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:44" (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 03:31:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:31:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:31:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:31:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:31:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:31:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:31:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:31:44,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:31:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:31:44,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:31:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:31:44,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:31:44,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:31:44,811 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 03:31:45,518 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:31:45,518 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:31:45,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:31:45 BoogieIcfgContainer [2019-12-27 03:31:45,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:31:45,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:31:45,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:31:45,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:31:45,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:31:43" (1/3) ... [2019-12-27 03:31:45,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3859cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:31:45, skipping insertion in model container [2019-12-27 03:31:45,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:44" (2/3) ... [2019-12-27 03:31:45,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3859cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:31:45, skipping insertion in model container [2019-12-27 03:31:45,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:31:45" (3/3) ... [2019-12-27 03:31:45,528 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_pso.opt.i [2019-12-27 03:31:45,539 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:31:45,539 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:31:45,547 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:31:45,548 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:31:45,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,588 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,589 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,630 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,630 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,630 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,631 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,631 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,638 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,638 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,646 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,647 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,647 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,652 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,652 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,656 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:31:45,675 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:31:45,695 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:31:45,695 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:31:45,695 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:31:45,695 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:31:45,695 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:31:45,695 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:31:45,696 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:31:45,696 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:31:45,712 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 03:31:45,714 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 03:31:45,807 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 03:31:45,808 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:31:45,823 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:31:45,847 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 03:31:45,897 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 03:31:45,897 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:31:45,905 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:31:45,924 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 03:31:45,925 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:31:51,345 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 03:31:51,464 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 03:31:51,589 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-27 03:31:51,589 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 03:31:51,593 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 03:32:03,244 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-27 03:32:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-27 03:32:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:32:03,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:03,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:32:03,252 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:03,259 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-27 03:32:03,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:03,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790392732] [2019-12-27 03:32:03,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:03,479 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 03:32:03,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790392732] [2019-12-27 03:32:03,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:03,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:32:03,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327617878] [2019-12-27 03:32:03,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:32:03,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:03,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:32:03,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:32:03,503 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-27 03:32:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:05,890 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-27 03:32:05,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:32:05,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:32:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:06,460 INFO L225 Difference]: With dead ends: 85012 [2019-12-27 03:32:06,461 INFO L226 Difference]: Without dead ends: 80140 [2019-12-27 03:32:06,464 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 03:32:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-27 03:32:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-27 03:32:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-27 03:32:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-27 03:32:14,338 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-27 03:32:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:14,339 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-27 03:32:14,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:32:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-27 03:32:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:32:14,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:14,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:14,348 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:14,348 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-27 03:32:14,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:14,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336406521] [2019-12-27 03:32:14,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:14,450 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 03:32:14,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336406521] [2019-12-27 03:32:14,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:14,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:32:14,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427497285] [2019-12-27 03:32:14,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:32:14,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:14,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:32:14,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:32:14,454 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-27 03:32:19,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:19,049 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-27 03:32:19,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:32:19,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:32:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:19,671 INFO L225 Difference]: With dead ends: 123388 [2019-12-27 03:32:19,671 INFO L226 Difference]: Without dead ends: 123290 [2019-12-27 03:32:19,672 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 03:32:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-27 03:32:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-27 03:32:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-27 03:32:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-27 03:32:30,430 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-27 03:32:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:30,431 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-27 03:32:30,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:32:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-27 03:32:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:32:30,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:30,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:30,435 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-27 03:32:30,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:30,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747393356] [2019-12-27 03:32:30,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:30,516 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 03:32:30,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747393356] [2019-12-27 03:32:30,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:30,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:32:30,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270276047] [2019-12-27 03:32:30,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:32:30,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:30,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:32:30,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:32:30,519 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-27 03:32:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:32,520 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-27 03:32:32,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:32:32,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:32:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:33,017 INFO L225 Difference]: With dead ends: 159677 [2019-12-27 03:32:33,018 INFO L226 Difference]: Without dead ends: 159565 [2019-12-27 03:32:33,018 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 03:32:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-27 03:32:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-27 03:32:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-27 03:32:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-27 03:32:45,015 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-27 03:32:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:45,016 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-27 03:32:45,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:32:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-27 03:32:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:32:45,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:45,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:45,020 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:45,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:45,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-27 03:32:45,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:45,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838747042] [2019-12-27 03:32:45,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:45,076 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 03:32:45,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838747042] [2019-12-27 03:32:45,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:45,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:32:45,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924759520] [2019-12-27 03:32:45,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:32:45,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:45,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:32:45,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:32:45,079 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-27 03:32:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:46,013 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-27 03:32:46,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:32:46,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 03:32:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:52,630 INFO L225 Difference]: With dead ends: 181618 [2019-12-27 03:32:52,631 INFO L226 Difference]: Without dead ends: 181618 [2019-12-27 03:32:52,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:32:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-27 03:32:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-27 03:32:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-27 03:33:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-27 03:33:00,901 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-27 03:33:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:33:00,902 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-27 03:33:00,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:33:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-27 03:33:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:33:00,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:33:00,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:33:00,906 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:33:00,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:33:00,906 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-27 03:33:00,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:33:00,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567734198] [2019-12-27 03:33:00,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:33:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:33:00,974 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 03:33:00,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567734198] [2019-12-27 03:33:00,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:33:00,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:33:00,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131587961] [2019-12-27 03:33:00,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:33:00,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:33:00,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:33:00,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:33:00,976 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-27 03:33:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:33:01,995 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-27 03:33:01,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:33:01,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:33:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:33:03,911 INFO L225 Difference]: With dead ends: 179622 [2019-12-27 03:33:03,911 INFO L226 Difference]: Without dead ends: 179542 [2019-12-27 03:33:03,911 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 03:33:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-27 03:33:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-27 03:33:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-27 03:33:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-27 03:33:18,714 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-27 03:33:18,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:33:18,714 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-27 03:33:18,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:33:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-27 03:33:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:33:18,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:33:18,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:33:18,718 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:33:18,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:33:18,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-27 03:33:18,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:33:18,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110652598] [2019-12-27 03:33:18,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:33:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:33:18,784 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 03:33:18,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110652598] [2019-12-27 03:33:18,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:33:18,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:33:18,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102043036] [2019-12-27 03:33:18,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:33:18,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:33:18,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:33:18,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:33:18,786 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-27 03:33:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:33:20,933 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-27 03:33:20,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:33:20,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:33:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:33:21,477 INFO L225 Difference]: With dead ends: 189091 [2019-12-27 03:33:21,477 INFO L226 Difference]: Without dead ends: 188995 [2019-12-27 03:33:21,477 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 03:33:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-27 03:33:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-27 03:33:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-27 03:33:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-27 03:33:36,015 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-27 03:33:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:33:36,015 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-27 03:33:36,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:33:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-27 03:33:36,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 03:33:36,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:33:36,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:33:36,034 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:33:36,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:33:36,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1828891691, now seen corresponding path program 1 times [2019-12-27 03:33:36,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:33:36,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626556413] [2019-12-27 03:33:36,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:33:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:33:36,101 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 03:33:36,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626556413] [2019-12-27 03:33:36,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:33:36,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:33:36,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960616437] [2019-12-27 03:33:36,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:33:36,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:33:36,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:33:36,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:33:36,105 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-27 03:33:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:33:42,058 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-27 03:33:42,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:33:42,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 03:33:42,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:33:42,538 INFO L225 Difference]: With dead ends: 160940 [2019-12-27 03:33:42,539 INFO L226 Difference]: Without dead ends: 160940 [2019-12-27 03:33:42,539 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 03:33:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-27 03:33:49,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-27 03:33:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-27 03:33:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-27 03:33:51,143 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-27 03:33:51,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:33:51,143 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-27 03:33:51,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:33:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-27 03:33:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:33:51,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:33:51,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:33:51,168 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:33:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:33:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2025528817, now seen corresponding path program 1 times [2019-12-27 03:33:51,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:33:51,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118677264] [2019-12-27 03:33:51,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:33:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:33:51,285 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 03:33:51,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118677264] [2019-12-27 03:33:51,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:33:51,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:33:51,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252327538] [2019-12-27 03:33:51,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:33:51,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:33:51,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:33:51,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:33:51,287 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-27 03:33:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:33:59,521 INFO L93 Difference]: Finished difference Result 297697 states and 1230452 transitions. [2019-12-27 03:33:59,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:33:59,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 03:33:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:00,047 INFO L225 Difference]: With dead ends: 297697 [2019-12-27 03:34:00,047 INFO L226 Difference]: Without dead ends: 170729 [2019-12-27 03:34:00,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 03:34:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170729 states. [2019-12-27 03:34:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170729 to 169732. [2019-12-27 03:34:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169732 states. [2019-12-27 03:34:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169732 states to 169732 states and 694021 transitions. [2019-12-27 03:34:08,656 INFO L78 Accepts]: Start accepts. Automaton has 169732 states and 694021 transitions. Word has length 19 [2019-12-27 03:34:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:08,656 INFO L462 AbstractCegarLoop]: Abstraction has 169732 states and 694021 transitions. [2019-12-27 03:34:08,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:34:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 169732 states and 694021 transitions. [2019-12-27 03:34:08,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:34:08,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:08,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:34:08,675 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:08,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:08,675 INFO L82 PathProgramCache]: Analyzing trace with hash 550104482, now seen corresponding path program 1 times [2019-12-27 03:34:08,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:08,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583543410] [2019-12-27 03:34:08,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:08,768 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 03:34:08,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583543410] [2019-12-27 03:34:08,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:08,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:34:08,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475061653] [2019-12-27 03:34:08,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:34:08,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:34:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:34:08,772 INFO L87 Difference]: Start difference. First operand 169732 states and 694021 transitions. Second operand 4 states. [2019-12-27 03:34:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:08,973 INFO L93 Difference]: Finished difference Result 49048 states and 168395 transitions. [2019-12-27 03:34:08,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:34:08,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 03:34:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:09,040 INFO L225 Difference]: With dead ends: 49048 [2019-12-27 03:34:09,040 INFO L226 Difference]: Without dead ends: 38053 [2019-12-27 03:34:09,040 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 03:34:09,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38053 states. [2019-12-27 03:34:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38053 to 37601. [2019-12-27 03:34:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37601 states. [2019-12-27 03:34:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37601 states to 37601 states and 124116 transitions. [2019-12-27 03:34:09,654 INFO L78 Accepts]: Start accepts. Automaton has 37601 states and 124116 transitions. Word has length 19 [2019-12-27 03:34:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:09,654 INFO L462 AbstractCegarLoop]: Abstraction has 37601 states and 124116 transitions. [2019-12-27 03:34:09,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:34:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 37601 states and 124116 transitions. [2019-12-27 03:34:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:34:09,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:09,661 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 03:34:09,661 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:09,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:09,661 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-27 03:34:09,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:09,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040881434] [2019-12-27 03:34:09,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:09,728 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 03:34:09,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040881434] [2019-12-27 03:34:09,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:09,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:34:09,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096582189] [2019-12-27 03:34:09,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:34:09,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:09,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:34:09,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:34:09,730 INFO L87 Difference]: Start difference. First operand 37601 states and 124116 transitions. Second operand 5 states. [2019-12-27 03:34:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:12,753 INFO L93 Difference]: Finished difference Result 50439 states and 163679 transitions. [2019-12-27 03:34:12,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:34:12,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 03:34:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:12,848 INFO L225 Difference]: With dead ends: 50439 [2019-12-27 03:34:12,848 INFO L226 Difference]: Without dead ends: 50137 [2019-12-27 03:34:12,849 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 03:34:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50137 states. [2019-12-27 03:34:13,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50137 to 38325. [2019-12-27 03:34:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38325 states. [2019-12-27 03:34:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38325 states to 38325 states and 126442 transitions. [2019-12-27 03:34:13,584 INFO L78 Accepts]: Start accepts. Automaton has 38325 states and 126442 transitions. Word has length 22 [2019-12-27 03:34:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:13,585 INFO L462 AbstractCegarLoop]: Abstraction has 38325 states and 126442 transitions. [2019-12-27 03:34:13,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:34:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 38325 states and 126442 transitions. [2019-12-27 03:34:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:34:13,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:13,592 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 03:34:13,592 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:13,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-27 03:34:13,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:13,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970020835] [2019-12-27 03:34:13,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:13,670 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 03:34:13,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970020835] [2019-12-27 03:34:13,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:13,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:34:13,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172431160] [2019-12-27 03:34:13,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:34:13,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:13,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:34:13,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:34:13,673 INFO L87 Difference]: Start difference. First operand 38325 states and 126442 transitions. Second operand 5 states. [2019-12-27 03:34:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:14,284 INFO L93 Difference]: Finished difference Result 50758 states and 164508 transitions. [2019-12-27 03:34:14,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:34:14,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 03:34:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:14,384 INFO L225 Difference]: With dead ends: 50758 [2019-12-27 03:34:14,385 INFO L226 Difference]: Without dead ends: 50338 [2019-12-27 03:34:14,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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 03:34:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50338 states. [2019-12-27 03:34:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50338 to 35870. [2019-12-27 03:34:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35870 states. [2019-12-27 03:34:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35870 states to 35870 states and 118280 transitions. [2019-12-27 03:34:15,452 INFO L78 Accepts]: Start accepts. Automaton has 35870 states and 118280 transitions. Word has length 22 [2019-12-27 03:34:15,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:15,452 INFO L462 AbstractCegarLoop]: Abstraction has 35870 states and 118280 transitions. [2019-12-27 03:34:15,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:34:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 35870 states and 118280 transitions. [2019-12-27 03:34:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:34:15,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:15,464 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 03:34:15,464 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:15,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:15,465 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-27 03:34:15,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:15,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634967391] [2019-12-27 03:34:15,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:15,548 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 03:34:15,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634967391] [2019-12-27 03:34:15,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:15,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:34:15,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039584740] [2019-12-27 03:34:15,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:34:15,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:15,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:34:15,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:34:15,550 INFO L87 Difference]: Start difference. First operand 35870 states and 118280 transitions. Second operand 5 states. [2019-12-27 03:34:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:16,047 INFO L93 Difference]: Finished difference Result 49184 states and 158828 transitions. [2019-12-27 03:34:16,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:34:16,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 03:34:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:16,127 INFO L225 Difference]: With dead ends: 49184 [2019-12-27 03:34:16,128 INFO L226 Difference]: Without dead ends: 48744 [2019-12-27 03:34:16,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 03:34:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48744 states. [2019-12-27 03:34:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48744 to 39958. [2019-12-27 03:34:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39958 states. [2019-12-27 03:34:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39958 states to 39958 states and 131043 transitions. [2019-12-27 03:34:17,220 INFO L78 Accepts]: Start accepts. Automaton has 39958 states and 131043 transitions. Word has length 25 [2019-12-27 03:34:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:17,220 INFO L462 AbstractCegarLoop]: Abstraction has 39958 states and 131043 transitions. [2019-12-27 03:34:17,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:34:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 39958 states and 131043 transitions. [2019-12-27 03:34:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:34:17,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:17,239 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 03:34:17,239 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:17,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:17,239 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-27 03:34:17,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:17,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626219660] [2019-12-27 03:34:17,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:34:17,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626219660] [2019-12-27 03:34:17,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:17,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:34:17,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172385007] [2019-12-27 03:34:17,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:34:17,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:34:17,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:34:17,342 INFO L87 Difference]: Start difference. First operand 39958 states and 131043 transitions. Second operand 5 states. [2019-12-27 03:34:17,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:17,484 INFO L93 Difference]: Finished difference Result 17988 states and 54909 transitions. [2019-12-27 03:34:17,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:34:17,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 03:34:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:17,519 INFO L225 Difference]: With dead ends: 17988 [2019-12-27 03:34:17,519 INFO L226 Difference]: Without dead ends: 15359 [2019-12-27 03:34:17,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:34:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15359 states. [2019-12-27 03:34:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15359 to 14933. [2019-12-27 03:34:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14933 states. [2019-12-27 03:34:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14933 states to 14933 states and 45288 transitions. [2019-12-27 03:34:17,768 INFO L78 Accepts]: Start accepts. Automaton has 14933 states and 45288 transitions. Word has length 28 [2019-12-27 03:34:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:17,768 INFO L462 AbstractCegarLoop]: Abstraction has 14933 states and 45288 transitions. [2019-12-27 03:34:17,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:34:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 14933 states and 45288 transitions. [2019-12-27 03:34:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:34:17,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:17,791 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 03:34:17,792 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:17,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1438865066, now seen corresponding path program 1 times [2019-12-27 03:34:17,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:17,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208867924] [2019-12-27 03:34:17,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:17,857 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 03:34:17,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208867924] [2019-12-27 03:34:17,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:17,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:34:17,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284197679] [2019-12-27 03:34:17,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:34:17,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:17,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:34:17,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:34:17,859 INFO L87 Difference]: Start difference. First operand 14933 states and 45288 transitions. Second operand 3 states. [2019-12-27 03:34:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:17,978 INFO L93 Difference]: Finished difference Result 21692 states and 66881 transitions. [2019-12-27 03:34:17,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:34:17,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 03:34:17,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:18,004 INFO L225 Difference]: With dead ends: 21692 [2019-12-27 03:34:18,004 INFO L226 Difference]: Without dead ends: 9192 [2019-12-27 03:34:18,006 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 03:34:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9192 states. [2019-12-27 03:34:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9192 to 9081. [2019-12-27 03:34:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9081 states. [2019-12-27 03:34:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9081 states to 9081 states and 27158 transitions. [2019-12-27 03:34:18,231 INFO L78 Accepts]: Start accepts. Automaton has 9081 states and 27158 transitions. Word has length 39 [2019-12-27 03:34:18,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:18,231 INFO L462 AbstractCegarLoop]: Abstraction has 9081 states and 27158 transitions. [2019-12-27 03:34:18,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:34:18,231 INFO L276 IsEmpty]: Start isEmpty. Operand 9081 states and 27158 transitions. [2019-12-27 03:34:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:34:18,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:18,246 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 03:34:18,246 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:18,247 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-27 03:34:18,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:18,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410953181] [2019-12-27 03:34:18,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:18,356 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 03:34:18,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410953181] [2019-12-27 03:34:18,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:18,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:34:18,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018305818] [2019-12-27 03:34:18,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:34:18,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:18,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:34:18,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:34:18,359 INFO L87 Difference]: Start difference. First operand 9081 states and 27158 transitions. Second operand 6 states. [2019-12-27 03:34:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:18,768 INFO L93 Difference]: Finished difference Result 9498 states and 28051 transitions. [2019-12-27 03:34:18,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:34:18,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 03:34:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:18,784 INFO L225 Difference]: With dead ends: 9498 [2019-12-27 03:34:18,785 INFO L226 Difference]: Without dead ends: 9330 [2019-12-27 03:34:18,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:34:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9330 states. [2019-12-27 03:34:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9330 to 9063. [2019-12-27 03:34:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2019-12-27 03:34:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 27129 transitions. [2019-12-27 03:34:18,976 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 27129 transitions. Word has length 40 [2019-12-27 03:34:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:18,977 INFO L462 AbstractCegarLoop]: Abstraction has 9063 states and 27129 transitions. [2019-12-27 03:34:18,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:34:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 27129 transitions. [2019-12-27 03:34:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:34:18,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:18,990 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 03:34:18,990 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:18,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1884333106, now seen corresponding path program 1 times [2019-12-27 03:34:18,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:18,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316281947] [2019-12-27 03:34:18,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:19,026 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 03:34:19,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316281947] [2019-12-27 03:34:19,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:19,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:34:19,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255566553] [2019-12-27 03:34:19,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:34:19,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:19,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:34:19,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:34:19,028 INFO L87 Difference]: Start difference. First operand 9063 states and 27129 transitions. Second operand 3 states. [2019-12-27 03:34:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:19,086 INFO L93 Difference]: Finished difference Result 11257 states and 32864 transitions. [2019-12-27 03:34:19,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:34:19,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 03:34:19,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:19,100 INFO L225 Difference]: With dead ends: 11257 [2019-12-27 03:34:19,103 INFO L226 Difference]: Without dead ends: 11257 [2019-12-27 03:34:19,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:34:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11257 states. [2019-12-27 03:34:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11257 to 9472. [2019-12-27 03:34:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9472 states. [2019-12-27 03:34:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9472 states to 9472 states and 27992 transitions. [2019-12-27 03:34:19,255 INFO L78 Accepts]: Start accepts. Automaton has 9472 states and 27992 transitions. Word has length 40 [2019-12-27 03:34:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:19,255 INFO L462 AbstractCegarLoop]: Abstraction has 9472 states and 27992 transitions. [2019-12-27 03:34:19,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:34:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 9472 states and 27992 transitions. [2019-12-27 03:34:19,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:34:19,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:19,264 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 03:34:19,264 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:19,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:19,265 INFO L82 PathProgramCache]: Analyzing trace with hash 809189858, now seen corresponding path program 1 times [2019-12-27 03:34:19,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:19,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140520158] [2019-12-27 03:34:19,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:19,420 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 03:34:19,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140520158] [2019-12-27 03:34:19,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:19,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:34:19,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665363816] [2019-12-27 03:34:19,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:34:19,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:19,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:34:19,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:34:19,422 INFO L87 Difference]: Start difference. First operand 9472 states and 27992 transitions. Second operand 6 states. [2019-12-27 03:34:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:20,205 INFO L93 Difference]: Finished difference Result 20451 states and 59995 transitions. [2019-12-27 03:34:20,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:34:20,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 03:34:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:20,241 INFO L225 Difference]: With dead ends: 20451 [2019-12-27 03:34:20,241 INFO L226 Difference]: Without dead ends: 20451 [2019-12-27 03:34:20,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:34:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20451 states. [2019-12-27 03:34:20,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20451 to 13538. [2019-12-27 03:34:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13538 states. [2019-12-27 03:34:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13538 states to 13538 states and 39670 transitions. [2019-12-27 03:34:20,486 INFO L78 Accepts]: Start accepts. Automaton has 13538 states and 39670 transitions. Word has length 40 [2019-12-27 03:34:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:20,486 INFO L462 AbstractCegarLoop]: Abstraction has 13538 states and 39670 transitions. [2019-12-27 03:34:20,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:34:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 13538 states and 39670 transitions. [2019-12-27 03:34:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:34:20,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:20,500 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 03:34:20,501 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:20,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1845992686, now seen corresponding path program 2 times [2019-12-27 03:34:20,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:20,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694786727] [2019-12-27 03:34:20,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:20,572 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 03:34:20,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694786727] [2019-12-27 03:34:20,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:20,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:34:20,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103181915] [2019-12-27 03:34:20,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:34:20,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:20,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:34:20,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:34:20,574 INFO L87 Difference]: Start difference. First operand 13538 states and 39670 transitions. Second operand 5 states. [2019-12-27 03:34:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:21,071 INFO L93 Difference]: Finished difference Result 20457 states and 59942 transitions. [2019-12-27 03:34:21,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:34:21,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 03:34:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:21,101 INFO L225 Difference]: With dead ends: 20457 [2019-12-27 03:34:21,101 INFO L226 Difference]: Without dead ends: 20457 [2019-12-27 03:34:21,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:34:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20457 states. [2019-12-27 03:34:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20457 to 17773. [2019-12-27 03:34:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17773 states. [2019-12-27 03:34:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17773 states to 17773 states and 52586 transitions. [2019-12-27 03:34:21,360 INFO L78 Accepts]: Start accepts. Automaton has 17773 states and 52586 transitions. Word has length 40 [2019-12-27 03:34:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:21,361 INFO L462 AbstractCegarLoop]: Abstraction has 17773 states and 52586 transitions. [2019-12-27 03:34:21,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:34:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 17773 states and 52586 transitions. [2019-12-27 03:34:21,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:34:21,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:21,383 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 03:34:21,383 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:21,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:21,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2114152388, now seen corresponding path program 3 times [2019-12-27 03:34:21,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:21,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319794377] [2019-12-27 03:34:21,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:21,475 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 03:34:21,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319794377] [2019-12-27 03:34:21,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:21,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:34:21,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008329000] [2019-12-27 03:34:21,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:34:21,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:21,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:34:21,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:34:21,477 INFO L87 Difference]: Start difference. First operand 17773 states and 52586 transitions. Second operand 7 states. [2019-12-27 03:34:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:22,587 INFO L93 Difference]: Finished difference Result 28681 states and 83844 transitions. [2019-12-27 03:34:22,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:34:22,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 03:34:22,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:22,624 INFO L225 Difference]: With dead ends: 28681 [2019-12-27 03:34:22,625 INFO L226 Difference]: Without dead ends: 28681 [2019-12-27 03:34:22,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:34:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28681 states. [2019-12-27 03:34:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28681 to 17808. [2019-12-27 03:34:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17808 states. [2019-12-27 03:34:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17808 states to 17808 states and 52686 transitions. [2019-12-27 03:34:23,065 INFO L78 Accepts]: Start accepts. Automaton has 17808 states and 52686 transitions. Word has length 40 [2019-12-27 03:34:23,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:23,065 INFO L462 AbstractCegarLoop]: Abstraction has 17808 states and 52686 transitions. [2019-12-27 03:34:23,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:34:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 17808 states and 52686 transitions. [2019-12-27 03:34:23,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:34:23,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:23,083 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 03:34:23,083 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:23,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash -582218170, now seen corresponding path program 4 times [2019-12-27 03:34:23,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:23,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630731405] [2019-12-27 03:34:23,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:23,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 03:34:23,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630731405] [2019-12-27 03:34:23,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:23,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:34:23,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214017206] [2019-12-27 03:34:23,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:34:23,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:23,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:34:23,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:34:23,187 INFO L87 Difference]: Start difference. First operand 17808 states and 52686 transitions. Second operand 7 states. [2019-12-27 03:34:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:23,962 INFO L93 Difference]: Finished difference Result 23246 states and 67536 transitions. [2019-12-27 03:34:23,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:34:23,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 03:34:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:23,996 INFO L225 Difference]: With dead ends: 23246 [2019-12-27 03:34:23,996 INFO L226 Difference]: Without dead ends: 23246 [2019-12-27 03:34:23,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:34:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23246 states. [2019-12-27 03:34:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23246 to 17868. [2019-12-27 03:34:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17868 states. [2019-12-27 03:34:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17868 states to 17868 states and 52856 transitions. [2019-12-27 03:34:24,276 INFO L78 Accepts]: Start accepts. Automaton has 17868 states and 52856 transitions. Word has length 40 [2019-12-27 03:34:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:24,276 INFO L462 AbstractCegarLoop]: Abstraction has 17868 states and 52856 transitions. [2019-12-27 03:34:24,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:34:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 17868 states and 52856 transitions. [2019-12-27 03:34:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:34:24,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:24,294 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] [2019-12-27 03:34:24,294 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:24,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448647, now seen corresponding path program 1 times [2019-12-27 03:34:24,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:24,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411230607] [2019-12-27 03:34:24,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:24,373 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 03:34:24,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411230607] [2019-12-27 03:34:24,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:24,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:34:24,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813109413] [2019-12-27 03:34:24,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:34:24,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:24,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:34:24,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:34:24,375 INFO L87 Difference]: Start difference. First operand 17868 states and 52856 transitions. Second operand 6 states. [2019-12-27 03:34:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:24,723 INFO L93 Difference]: Finished difference Result 18256 states and 53648 transitions. [2019-12-27 03:34:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:34:24,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 03:34:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:24,747 INFO L225 Difference]: With dead ends: 18256 [2019-12-27 03:34:24,748 INFO L226 Difference]: Without dead ends: 18004 [2019-12-27 03:34:24,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:34:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18004 states. [2019-12-27 03:34:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18004 to 17403. [2019-12-27 03:34:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17403 states. [2019-12-27 03:34:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17403 states to 17403 states and 51826 transitions. [2019-12-27 03:34:24,971 INFO L78 Accepts]: Start accepts. Automaton has 17403 states and 51826 transitions. Word has length 41 [2019-12-27 03:34:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:24,972 INFO L462 AbstractCegarLoop]: Abstraction has 17403 states and 51826 transitions. [2019-12-27 03:34:24,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:34:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 17403 states and 51826 transitions. [2019-12-27 03:34:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:34:24,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:24,987 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] [2019-12-27 03:34:24,988 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:24,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1425122982, now seen corresponding path program 1 times [2019-12-27 03:34:24,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:24,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191487751] [2019-12-27 03:34:24,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:25,038 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 03:34:25,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191487751] [2019-12-27 03:34:25,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:25,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:34:25,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543603658] [2019-12-27 03:34:25,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:34:25,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:25,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:34:25,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:34:25,040 INFO L87 Difference]: Start difference. First operand 17403 states and 51826 transitions. Second operand 3 states. [2019-12-27 03:34:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:25,093 INFO L93 Difference]: Finished difference Result 13738 states and 40339 transitions. [2019-12-27 03:34:25,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:34:25,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 03:34:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:25,124 INFO L225 Difference]: With dead ends: 13738 [2019-12-27 03:34:25,124 INFO L226 Difference]: Without dead ends: 13738 [2019-12-27 03:34:25,125 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 03:34:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13738 states. [2019-12-27 03:34:25,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13738 to 13722. [2019-12-27 03:34:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13722 states. [2019-12-27 03:34:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13722 states to 13722 states and 40299 transitions. [2019-12-27 03:34:25,618 INFO L78 Accepts]: Start accepts. Automaton has 13722 states and 40299 transitions. Word has length 41 [2019-12-27 03:34:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:25,618 INFO L462 AbstractCegarLoop]: Abstraction has 13722 states and 40299 transitions. [2019-12-27 03:34:25,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:34:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 13722 states and 40299 transitions. [2019-12-27 03:34:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:34:25,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:25,636 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] [2019-12-27 03:34:25,636 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1212552046, now seen corresponding path program 1 times [2019-12-27 03:34:25,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:25,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670139996] [2019-12-27 03:34:25,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:25,715 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 03:34:25,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670139996] [2019-12-27 03:34:25,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:25,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:34:25,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45604545] [2019-12-27 03:34:25,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:34:25,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:25,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:34:25,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:34:25,717 INFO L87 Difference]: Start difference. First operand 13722 states and 40299 transitions. Second operand 6 states. [2019-12-27 03:34:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:25,846 INFO L93 Difference]: Finished difference Result 12639 states and 37559 transitions. [2019-12-27 03:34:25,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:34:25,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 03:34:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:25,866 INFO L225 Difference]: With dead ends: 12639 [2019-12-27 03:34:25,866 INFO L226 Difference]: Without dead ends: 11132 [2019-12-27 03:34:25,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:34:25,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11132 states. [2019-12-27 03:34:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11132 to 10712. [2019-12-27 03:34:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10712 states. [2019-12-27 03:34:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10712 states to 10712 states and 32883 transitions. [2019-12-27 03:34:26,043 INFO L78 Accepts]: Start accepts. Automaton has 10712 states and 32883 transitions. Word has length 41 [2019-12-27 03:34:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:26,043 INFO L462 AbstractCegarLoop]: Abstraction has 10712 states and 32883 transitions. [2019-12-27 03:34:26,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:34:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 10712 states and 32883 transitions. [2019-12-27 03:34:26,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:34:26,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:26,053 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] [2019-12-27 03:34:26,054 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:26,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:26,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1879967444, now seen corresponding path program 1 times [2019-12-27 03:34:26,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:26,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158032689] [2019-12-27 03:34:26,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:26,160 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 03:34:26,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158032689] [2019-12-27 03:34:26,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:26,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:34:26,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950187599] [2019-12-27 03:34:26,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:34:26,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:26,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:34:26,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:34:26,162 INFO L87 Difference]: Start difference. First operand 10712 states and 32883 transitions. Second operand 9 states. [2019-12-27 03:34:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:27,243 INFO L93 Difference]: Finished difference Result 20419 states and 61354 transitions. [2019-12-27 03:34:27,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 03:34:27,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 03:34:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:27,276 INFO L225 Difference]: With dead ends: 20419 [2019-12-27 03:34:27,276 INFO L226 Difference]: Without dead ends: 14208 [2019-12-27 03:34:27,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:34:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14208 states. [2019-12-27 03:34:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14208 to 13334. [2019-12-27 03:34:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13334 states. [2019-12-27 03:34:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13334 states to 13334 states and 40048 transitions. [2019-12-27 03:34:27,553 INFO L78 Accepts]: Start accepts. Automaton has 13334 states and 40048 transitions. Word has length 55 [2019-12-27 03:34:27,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:27,553 INFO L462 AbstractCegarLoop]: Abstraction has 13334 states and 40048 transitions. [2019-12-27 03:34:27,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:34:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand 13334 states and 40048 transitions. [2019-12-27 03:34:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:34:27,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:27,567 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] [2019-12-27 03:34:27,567 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:27,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1331122226, now seen corresponding path program 2 times [2019-12-27 03:34:27,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:27,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481572647] [2019-12-27 03:34:27,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:27,728 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 03:34:27,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481572647] [2019-12-27 03:34:27,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:27,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:34:27,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505892502] [2019-12-27 03:34:27,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:34:27,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:27,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:34:27,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:34:27,730 INFO L87 Difference]: Start difference. First operand 13334 states and 40048 transitions. Second operand 9 states. [2019-12-27 03:34:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:28,868 INFO L93 Difference]: Finished difference Result 19363 states and 57022 transitions. [2019-12-27 03:34:28,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:34:28,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 03:34:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:28,896 INFO L225 Difference]: With dead ends: 19363 [2019-12-27 03:34:28,896 INFO L226 Difference]: Without dead ends: 19363 [2019-12-27 03:34:28,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:34:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19363 states. [2019-12-27 03:34:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19363 to 14390. [2019-12-27 03:34:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14390 states. [2019-12-27 03:34:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14390 states to 14390 states and 43092 transitions. [2019-12-27 03:34:29,117 INFO L78 Accepts]: Start accepts. Automaton has 14390 states and 43092 transitions. Word has length 55 [2019-12-27 03:34:29,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:29,117 INFO L462 AbstractCegarLoop]: Abstraction has 14390 states and 43092 transitions. [2019-12-27 03:34:29,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:34:29,117 INFO L276 IsEmpty]: Start isEmpty. Operand 14390 states and 43092 transitions. [2019-12-27 03:34:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:34:29,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:29,132 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] [2019-12-27 03:34:29,133 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:29,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1675553042, now seen corresponding path program 3 times [2019-12-27 03:34:29,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:29,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848444180] [2019-12-27 03:34:29,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:29,299 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 03:34:29,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848444180] [2019-12-27 03:34:29,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:29,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:34:29,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302572258] [2019-12-27 03:34:29,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:34:29,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:29,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:34:29,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:34:29,301 INFO L87 Difference]: Start difference. First operand 14390 states and 43092 transitions. Second operand 11 states. [2019-12-27 03:34:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:30,139 INFO L93 Difference]: Finished difference Result 20865 states and 62215 transitions. [2019-12-27 03:34:30,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 03:34:30,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 03:34:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:30,167 INFO L225 Difference]: With dead ends: 20865 [2019-12-27 03:34:30,167 INFO L226 Difference]: Without dead ends: 19819 [2019-12-27 03:34:30,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2019-12-27 03:34:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19819 states. [2019-12-27 03:34:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19819 to 18147. [2019-12-27 03:34:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18147 states. [2019-12-27 03:34:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18147 states to 18147 states and 54147 transitions. [2019-12-27 03:34:30,445 INFO L78 Accepts]: Start accepts. Automaton has 18147 states and 54147 transitions. Word has length 55 [2019-12-27 03:34:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:30,445 INFO L462 AbstractCegarLoop]: Abstraction has 18147 states and 54147 transitions. [2019-12-27 03:34:30,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:34:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 18147 states and 54147 transitions. [2019-12-27 03:34:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:34:30,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:30,467 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] [2019-12-27 03:34:30,467 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:30,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:30,467 INFO L82 PathProgramCache]: Analyzing trace with hash -17231120, now seen corresponding path program 4 times [2019-12-27 03:34:30,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:30,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523807440] [2019-12-27 03:34:30,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:30,620 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 03:34:30,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523807440] [2019-12-27 03:34:30,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:30,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:34:30,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964950907] [2019-12-27 03:34:30,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:34:30,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:30,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:34:30,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:34:30,621 INFO L87 Difference]: Start difference. First operand 18147 states and 54147 transitions. Second operand 11 states. [2019-12-27 03:34:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:31,395 INFO L93 Difference]: Finished difference Result 19977 states and 58832 transitions. [2019-12-27 03:34:31,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:34:31,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 03:34:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:31,418 INFO L225 Difference]: With dead ends: 19977 [2019-12-27 03:34:31,418 INFO L226 Difference]: Without dead ends: 14792 [2019-12-27 03:34:31,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:34:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14792 states. [2019-12-27 03:34:31,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14792 to 13318. [2019-12-27 03:34:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13318 states. [2019-12-27 03:34:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13318 states to 13318 states and 39664 transitions. [2019-12-27 03:34:31,634 INFO L78 Accepts]: Start accepts. Automaton has 13318 states and 39664 transitions. Word has length 55 [2019-12-27 03:34:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:31,635 INFO L462 AbstractCegarLoop]: Abstraction has 13318 states and 39664 transitions. [2019-12-27 03:34:31,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:34:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 13318 states and 39664 transitions. [2019-12-27 03:34:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:34:31,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:31,649 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] [2019-12-27 03:34:31,649 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:31,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:31,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1658904824, now seen corresponding path program 5 times [2019-12-27 03:34:31,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:31,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896115149] [2019-12-27 03:34:31,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:31,781 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 03:34:31,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896115149] [2019-12-27 03:34:31,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:31,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:34:31,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324822516] [2019-12-27 03:34:31,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:34:31,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:31,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:34:31,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:34:31,783 INFO L87 Difference]: Start difference. First operand 13318 states and 39664 transitions. Second operand 9 states. [2019-12-27 03:34:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:33,273 INFO L93 Difference]: Finished difference Result 20950 states and 61021 transitions. [2019-12-27 03:34:33,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 03:34:33,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 03:34:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:33,301 INFO L225 Difference]: With dead ends: 20950 [2019-12-27 03:34:33,301 INFO L226 Difference]: Without dead ends: 20950 [2019-12-27 03:34:33,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-12-27 03:34:33,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20950 states. [2019-12-27 03:34:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20950 to 12973. [2019-12-27 03:34:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12973 states. [2019-12-27 03:34:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12973 states to 12973 states and 38736 transitions. [2019-12-27 03:34:33,537 INFO L78 Accepts]: Start accepts. Automaton has 12973 states and 38736 transitions. Word has length 55 [2019-12-27 03:34:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:33,537 INFO L462 AbstractCegarLoop]: Abstraction has 12973 states and 38736 transitions. [2019-12-27 03:34:33,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:34:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 12973 states and 38736 transitions. [2019-12-27 03:34:33,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:34:33,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:33,667 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] [2019-12-27 03:34:33,668 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash 677875510, now seen corresponding path program 6 times [2019-12-27 03:34:33,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:33,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359947629] [2019-12-27 03:34:33,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:33,736 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 03:34:33,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359947629] [2019-12-27 03:34:33,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:33,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:34:33,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54932016] [2019-12-27 03:34:33,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:34:33,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:34:33,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:34:33,738 INFO L87 Difference]: Start difference. First operand 12973 states and 38736 transitions. Second operand 3 states. [2019-12-27 03:34:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:33,796 INFO L93 Difference]: Finished difference Result 12971 states and 38731 transitions. [2019-12-27 03:34:33,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:34:33,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:34:33,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:33,820 INFO L225 Difference]: With dead ends: 12971 [2019-12-27 03:34:33,820 INFO L226 Difference]: Without dead ends: 12971 [2019-12-27 03:34:33,820 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 03:34:33,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12971 states. [2019-12-27 03:34:34,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12971 to 10477. [2019-12-27 03:34:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10477 states. [2019-12-27 03:34:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10477 states to 10477 states and 31680 transitions. [2019-12-27 03:34:34,032 INFO L78 Accepts]: Start accepts. Automaton has 10477 states and 31680 transitions. Word has length 55 [2019-12-27 03:34:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:34,032 INFO L462 AbstractCegarLoop]: Abstraction has 10477 states and 31680 transitions. [2019-12-27 03:34:34,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:34:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 10477 states and 31680 transitions. [2019-12-27 03:34:34,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:34:34,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:34,043 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] [2019-12-27 03:34:34,043 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 918799478, now seen corresponding path program 1 times [2019-12-27 03:34:34,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:34,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157980253] [2019-12-27 03:34:34,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:34:34,214 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 03:34:34,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157980253] [2019-12-27 03:34:34,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:34:34,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:34:34,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40144813] [2019-12-27 03:34:34,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:34:34,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:34:34,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:34:34,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:34:34,219 INFO L87 Difference]: Start difference. First operand 10477 states and 31680 transitions. Second operand 12 states. [2019-12-27 03:34:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:34:34,942 INFO L93 Difference]: Finished difference Result 11791 states and 35025 transitions. [2019-12-27 03:34:34,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:34:34,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 03:34:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:34:34,959 INFO L225 Difference]: With dead ends: 11791 [2019-12-27 03:34:34,960 INFO L226 Difference]: Without dead ends: 11131 [2019-12-27 03:34:34,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 03:34:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11131 states. [2019-12-27 03:34:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11131 to 10169. [2019-12-27 03:34:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10169 states. [2019-12-27 03:34:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 30872 transitions. [2019-12-27 03:34:35,119 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 30872 transitions. Word has length 56 [2019-12-27 03:34:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:34:35,119 INFO L462 AbstractCegarLoop]: Abstraction has 10169 states and 30872 transitions. [2019-12-27 03:34:35,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:34:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 30872 transitions. [2019-12-27 03:34:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:34:35,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:34:35,130 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] [2019-12-27 03:34:35,130 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:34:35,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:34:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1649345490, now seen corresponding path program 2 times [2019-12-27 03:34:35,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:34:35,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175379839] [2019-12-27 03:34:35,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:34:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:34:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:34:35,230 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:34:35,230 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:34:35,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1906~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1906~0.base_26|) |v_ULTIMATE.start_main_~#t1906~0.offset_20| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_643) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= v_~main$tmp_guard1~0_51 0) (= |v_ULTIMATE.start_main_~#t1906~0.offset_20| 0) (= v_~main$tmp_guard0~0_41 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1906~0.base_26|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1906~0.base_26| 1) |v_#valid_62|) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (= v_~y~0_300 0) (= 0 |v_#NULL.base_5|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1906~0.base_26|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1906~0.base_26| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ULTIMATE.start_main_~#t1906~0.offset=|v_ULTIMATE.start_main_~#t1906~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ULTIMATE.start_main_~#t1906~0.base=|v_ULTIMATE.start_main_~#t1906~0.base_26|, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1907~0.offset=|v_ULTIMATE.start_main_~#t1907~0.offset_20|, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ULTIMATE.start_main_~#t1907~0.base=|v_ULTIMATE.start_main_~#t1907~0.base_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_~#t1908~0.offset=|v_ULTIMATE.start_main_~#t1908~0.offset_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_300, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1908~0.base=|v_ULTIMATE.start_main_~#t1908~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t1907~0.base, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1908~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t1906~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t1906~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1907~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1908~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:34:35,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1907~0.base_10| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1907~0.base_10|) (= |v_ULTIMATE.start_main_~#t1907~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1907~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1907~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1907~0.base_10|) |v_ULTIMATE.start_main_~#t1907~0.offset_9| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1907~0.base_10|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1907~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1907~0.offset=|v_ULTIMATE.start_main_~#t1907~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t1907~0.base=|v_ULTIMATE.start_main_~#t1907~0.base_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1907~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1907~0.base, #length] because there is no mapped edge [2019-12-27 03:34:35,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= (mod v_~x$w_buff1_used~0_45 256) 0) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_8 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (= v_P1Thread1of1ForFork0_~arg.base_8 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0~0_22) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_10, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_8, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_8, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 03:34:35,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1908~0.base_11| 1) |v_#valid_27|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1908~0.base_11| 4) |v_#length_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1908~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1908~0.base_11|) |v_ULTIMATE.start_main_~#t1908~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t1908~0.base_11| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1908~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1908~0.base_11|) (= |v_ULTIMATE.start_main_~#t1908~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1908~0.base=|v_ULTIMATE.start_main_~#t1908~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1908~0.offset=|v_ULTIMATE.start_main_~#t1908~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1908~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1908~0.offset] because there is no mapped edge [2019-12-27 03:34:35,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In1998586760 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1998586760 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out1998586760| ~x$w_buff1~0_In1998586760) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In1998586760 |P2Thread1of1ForFork1_#t~ite32_Out1998586760|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1998586760, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1998586760, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1998586760, ~x~0=~x~0_In1998586760} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1998586760|, ~x$w_buff1~0=~x$w_buff1~0_In1998586760, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1998586760, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1998586760, ~x~0=~x~0_In1998586760} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 03:34:35,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 03:34:35,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1594172733 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1594172733 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1594172733|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1594172733 |P2Thread1of1ForFork1_#t~ite34_Out1594172733|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1594172733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1594172733} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1594172733|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1594172733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1594172733} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:34:35,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2120433549 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In2120433549| |P0Thread1of1ForFork2_#t~ite8_Out2120433549|) (= ~x$w_buff0~0_In2120433549 |P0Thread1of1ForFork2_#t~ite9_Out2120433549|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out2120433549| ~x$w_buff0~0_In2120433549) (= |P0Thread1of1ForFork2_#t~ite8_Out2120433549| |P0Thread1of1ForFork2_#t~ite9_Out2120433549|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In2120433549 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In2120433549 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In2120433549 256)) .cse1) (= (mod ~x$w_buff0_used~0_In2120433549 256) 0)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In2120433549, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2120433549, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In2120433549|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2120433549, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2120433549, ~weak$$choice2~0=~weak$$choice2~0_In2120433549, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120433549} OutVars{~x$w_buff0~0=~x$w_buff0~0_In2120433549, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2120433549, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out2120433549|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2120433549, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out2120433549|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2120433549, ~weak$$choice2~0=~weak$$choice2~0_In2120433549, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120433549} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 03:34:35,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-261569981 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-261569981 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-261569981|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-261569981 |P1Thread1of1ForFork0_#t~ite28_Out-261569981|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-261569981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-261569981} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-261569981, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-261569981|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-261569981} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 03:34:35,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-696646245 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-696646245 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-696646245 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-696646245 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-696646245|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-696646245 |P1Thread1of1ForFork0_#t~ite29_Out-696646245|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-696646245, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-696646245, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-696646245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-696646245} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-696646245, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-696646245, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-696646245, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-696646245|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-696646245} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 03:34:35,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-192738310 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-192738310 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-192738310) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-192738310 ~x$r_buff0_thd2~0_Out-192738310) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-192738310, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-192738310} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-192738310|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-192738310, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-192738310} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:34:35,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1723688037 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1723688037 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1723688037 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1723688037 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1723688037| ~x$r_buff1_thd2~0_In-1723688037) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1723688037|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1723688037, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1723688037, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1723688037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1723688037} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1723688037|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1723688037, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1723688037, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1723688037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1723688037} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 03:34:35,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 03:34:35,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In404268599 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In404268599 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In404268599 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In404268599 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out404268599|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In404268599 |P2Thread1of1ForFork1_#t~ite35_Out404268599|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In404268599, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In404268599, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In404268599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In404268599} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out404268599|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In404268599, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In404268599, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In404268599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In404268599} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 03:34:35,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-376229733 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-376229733 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-376229733| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-376229733| ~x$r_buff0_thd3~0_In-376229733)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-376229733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376229733} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-376229733|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-376229733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376229733} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 03:34:35,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-323704913 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In-323704913| |P0Thread1of1ForFork2_#t~ite17_Out-323704913|) (= |P0Thread1of1ForFork2_#t~ite18_Out-323704913| ~x$w_buff1_used~0_In-323704913) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-323704913 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-323704913 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-323704913 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-323704913 256))))) (= |P0Thread1of1ForFork2_#t~ite17_Out-323704913| ~x$w_buff1_used~0_In-323704913) (= |P0Thread1of1ForFork2_#t~ite17_Out-323704913| |P0Thread1of1ForFork2_#t~ite18_Out-323704913|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-323704913, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-323704913|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-323704913, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-323704913, ~weak$$choice2~0=~weak$$choice2~0_In-323704913, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-323704913} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-323704913, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-323704913|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-323704913|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-323704913, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-323704913, ~weak$$choice2~0=~weak$$choice2~0_In-323704913, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-323704913} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 03:34:35,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 03:34:35,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In691127273 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In691127273| |P0Thread1of1ForFork2_#t~ite23_Out691127273|) (= ~x$r_buff1_thd1~0_In691127273 |P0Thread1of1ForFork2_#t~ite24_Out691127273|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In691127273 256) 0))) (or (= (mod ~x$w_buff0_used~0_In691127273 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In691127273 256))) (and (= 0 (mod ~x$r_buff1_thd1~0_In691127273 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite24_Out691127273| |P0Thread1of1ForFork2_#t~ite23_Out691127273|) (= ~x$r_buff1_thd1~0_In691127273 |P0Thread1of1ForFork2_#t~ite23_Out691127273|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In691127273, ~x$w_buff1_used~0=~x$w_buff1_used~0_In691127273, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In691127273, ~weak$$choice2~0=~weak$$choice2~0_In691127273, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In691127273|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In691127273} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In691127273, ~x$w_buff1_used~0=~x$w_buff1_used~0_In691127273, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In691127273, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out691127273|, ~weak$$choice2~0=~weak$$choice2~0_In691127273, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out691127273|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In691127273} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 03:34:35,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In317529968 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In317529968 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In317529968 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In317529968 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In317529968 |P2Thread1of1ForFork1_#t~ite37_Out317529968|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out317529968|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In317529968, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In317529968, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In317529968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In317529968} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out317529968|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In317529968, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In317529968, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In317529968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In317529968} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:34:35,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 03:34:35,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 03:34:35,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:34:35,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1024256736 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1024256736 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out1024256736| ~x$w_buff1~0_In1024256736)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out1024256736| ~x~0_In1024256736)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1024256736, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1024256736, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1024256736, ~x~0=~x~0_In1024256736} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1024256736|, ~x$w_buff1~0=~x$w_buff1~0_In1024256736, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1024256736, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1024256736, ~x~0=~x~0_In1024256736} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 03:34:35,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 03:34:35,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1450280513 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1450280513 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1450280513| ~x$w_buff0_used~0_In1450280513)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out1450280513|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1450280513, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1450280513} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1450280513, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1450280513|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1450280513} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 03:34:35,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-974338010 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-974338010 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-974338010 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-974338010 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-974338010 |ULTIMATE.start_main_#t~ite44_Out-974338010|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-974338010|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-974338010, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-974338010, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-974338010, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-974338010} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-974338010, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-974338010, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-974338010, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-974338010|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-974338010} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 03:34:35,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-468691020 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-468691020 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-468691020| ~x$r_buff0_thd0~0_In-468691020) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-468691020|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-468691020, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-468691020} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-468691020, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-468691020|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-468691020} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:34:35,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In-1865820696 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1865820696 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1865820696 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1865820696 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1865820696|)) (and (= |ULTIMATE.start_main_#t~ite46_Out-1865820696| ~x$r_buff1_thd0~0_In-1865820696) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1865820696, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1865820696, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1865820696, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1865820696} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1865820696, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1865820696|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1865820696, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1865820696, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1865820696} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 03:34:35,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 0) (= v_~y~0_272 2) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:34:35,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:34:35 BasicIcfg [2019-12-27 03:34:35,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:34:35,355 INFO L168 Benchmark]: Toolchain (without parser) took 171502.73 ms. Allocated memory was 139.5 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 102.3 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 948.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:34:35,356 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 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 03:34:35,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.27 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.1 MB in the beginning and 158.0 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:34:35,357 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.85 ms. Allocated memory is still 203.9 MB. Free memory was 158.0 MB in the beginning and 155.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:34:35,358 INFO L168 Benchmark]: Boogie Preprocessor took 44.46 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:34:35,358 INFO L168 Benchmark]: RCFGBuilder took 784.58 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 106.6 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:34:35,359 INFO L168 Benchmark]: TraceAbstraction took 169832.96 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 106.0 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 887.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:34:35,361 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.23 ms. Allocated memory is still 139.5 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 775.27 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.1 MB in the beginning and 158.0 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.85 ms. Allocated memory is still 203.9 MB. Free memory was 158.0 MB in the beginning and 155.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.46 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 784.58 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 106.6 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 169832.96 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 106.0 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 887.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1906, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1907, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1908, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 169.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 54.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5125 SDtfs, 6883 SDslu, 14946 SDs, 0 SdLazy, 9063 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 47 SyntacticMatches, 26 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169732occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 93.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 197436 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1070 NumberOfCodeBlocks, 1070 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 161220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...