/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/safe004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:30:51,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:30:51,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:30:51,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:30:51,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:30:51,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:30:51,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:30:51,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:30:51,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:30:51,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:30:51,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:30:51,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:30:51,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:30:51,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:30:51,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:30:51,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:30:51,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:30:51,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:30:51,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:30:51,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:30:51,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:30:51,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:30:51,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:30:51,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:30:51,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:30:51,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:30:51,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:30:51,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:30:51,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:30:51,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:30:51,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:30:51,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:30:51,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:30:51,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:30:51,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:30:51,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:30:51,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:30:51,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:30:51,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:30:51,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:30:51,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:30:51,583 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:30:51,610 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:30:51,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:30:51,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:30:51,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:30:51,614 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:30:51,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:30:51,615 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:30:51,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:30:51,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:30:51,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:30:51,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:30:51,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:30:51,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:30:51,617 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:30:51,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:30:51,617 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:30:51,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:30:51,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:30:51,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:30:51,618 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:30:51,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:30:51,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:30:51,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:30:51,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:30:51,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:30:51,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:30:51,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:30:51,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:30:51,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:30:51,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:30:51,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:30:51,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:30:51,906 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:30:51,906 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:30:51,907 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2019-12-27 03:30:51,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75b8f29ed/dd27f5c8abb546c6937f3ccf48eb7eb7/FLAG61542d7bc [2019-12-27 03:30:52,534 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:30:52,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2019-12-27 03:30:52,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75b8f29ed/dd27f5c8abb546c6937f3ccf48eb7eb7/FLAG61542d7bc [2019-12-27 03:30:52,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75b8f29ed/dd27f5c8abb546c6937f3ccf48eb7eb7 [2019-12-27 03:30:52,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:30:52,854 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:30:52,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:30:52,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:30:52,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:30:52,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:30:52" (1/1) ... [2019-12-27 03:30:52,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e06cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:52, skipping insertion in model container [2019-12-27 03:30:52,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:30:52" (1/1) ... [2019-12-27 03:30:52,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:30:52,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:30:53,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:30:53,480 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:30:53,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:30:53,637 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:30:53,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:53 WrapperNode [2019-12-27 03:30:53,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:30:53,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:30:53,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:30:53,639 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:30:53,648 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:30:53" (1/1) ... [2019-12-27 03:30:53,679 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:30:53" (1/1) ... [2019-12-27 03:30:53,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:30:53,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:30:53,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:30:53,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:30:53,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:53" (1/1) ... [2019-12-27 03:30:53,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:53" (1/1) ... [2019-12-27 03:30:53,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:53" (1/1) ... [2019-12-27 03:30:53,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:53" (1/1) ... [2019-12-27 03:30:53,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:53" (1/1) ... [2019-12-27 03:30:53,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:53" (1/1) ... [2019-12-27 03:30:53,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:53" (1/1) ... [2019-12-27 03:30:53,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:30:53,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:30:53,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:30:53,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:30:53,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:53" (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:30:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:30:53,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:30:53,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:30:53,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:30:53,837 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:30:53,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:30:53,837 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:30:53,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:30:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:30:53,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:30:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:30:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:30:53,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:30:53,840 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:30:54,606 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:30:54,606 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:30:54,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:30:54 BoogieIcfgContainer [2019-12-27 03:30:54,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:30:54,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:30:54,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:30:54,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:30:54,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:30:52" (1/3) ... [2019-12-27 03:30:54,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8cf279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:30:54, skipping insertion in model container [2019-12-27 03:30:54,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:53" (2/3) ... [2019-12-27 03:30:54,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8cf279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:30:54, skipping insertion in model container [2019-12-27 03:30:54,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:30:54" (3/3) ... [2019-12-27 03:30:54,617 INFO L109 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2019-12-27 03:30:54,627 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:30:54,628 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:30:54,637 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:30:54,638 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:30:54,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,676 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,677 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,704 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,704 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,705 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,705 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,705 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,712 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,712 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,730 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,730 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,731 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,735 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,735 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:30:54,751 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:30:54,771 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:30:54,771 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:30:54,772 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:30:54,772 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:30:54,772 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:30:54,772 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:30:54,772 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:30:54,772 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:30:54,789 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 03:30:54,791 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 03:30:54,897 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 03:30:54,897 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:30:54,913 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:30:54,932 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 03:30:54,987 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 03:30:54,987 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:30:54,995 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:30:55,014 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 03:30:55,015 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:30:59,636 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-27 03:30:59,996 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 03:31:00,118 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 03:31:00,141 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-27 03:31:00,141 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 03:31:00,145 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-27 03:31:17,195 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-27 03:31:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-27 03:31:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:31:17,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:31:17,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:31:17,205 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:31:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:31:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-27 03:31:17,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:31:17,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784727280] [2019-12-27 03:31:17,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:31:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:31:17,445 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:31:17,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784727280] [2019-12-27 03:31:17,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:31:17,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:31:17,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103508901] [2019-12-27 03:31:17,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:31:17,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:31:17,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:31:17,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:31:17,471 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-27 03:31:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:31:18,440 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-27 03:31:18,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:31:18,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:31:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:31:21,956 INFO L225 Difference]: With dead ends: 107108 [2019-12-27 03:31:21,957 INFO L226 Difference]: Without dead ends: 104924 [2019-12-27 03:31:21,958 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:31:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-27 03:31:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-27 03:31:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-27 03:31:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-27 03:31:28,437 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-27 03:31:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:31:28,437 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-27 03:31:28,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:31:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-27 03:31:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:31:28,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:31:28,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:31:28,441 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:31:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:31:28,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-27 03:31:28,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:31:28,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986262188] [2019-12-27 03:31:28,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:31:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:31:28,582 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:31:28,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986262188] [2019-12-27 03:31:28,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:31:28,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:31:28,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568338914] [2019-12-27 03:31:28,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:31:28,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:31:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:31:28,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:31:28,587 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-27 03:31:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:31:33,301 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-27 03:31:33,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:31:33,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:31:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:31:33,897 INFO L225 Difference]: With dead ends: 168606 [2019-12-27 03:31:33,898 INFO L226 Difference]: Without dead ends: 168557 [2019-12-27 03:31:33,899 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:31:38,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-27 03:31:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-27 03:31:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-27 03:31:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-27 03:31:43,128 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-27 03:31:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:31:43,129 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-27 03:31:43,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:31:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-27 03:31:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:31:43,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:31:43,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:31:43,135 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:31:43,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:31:43,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-27 03:31:43,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:31:43,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296751977] [2019-12-27 03:31:43,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:31:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:31:43,226 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:31:43,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296751977] [2019-12-27 03:31:43,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:31:43,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:31:43,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292561980] [2019-12-27 03:31:43,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:31:43,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:31:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:31:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:31:43,230 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-27 03:31:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:31:49,537 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-27 03:31:49,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:31:49,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:31:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:31:50,898 INFO L225 Difference]: With dead ends: 217678 [2019-12-27 03:31:50,898 INFO L226 Difference]: Without dead ends: 217615 [2019-12-27 03:31:50,899 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:31:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-27 03:32:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-27 03:32:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-27 03:32:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-27 03:32:04,263 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-27 03:32:04,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:04,264 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-27 03:32:04,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:32:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-27 03:32:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:32:04,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:04,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:04,267 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:04,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-27 03:32:04,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:04,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074234353] [2019-12-27 03:32:04,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:04,336 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:04,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074234353] [2019-12-27 03:32:04,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:04,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:32:04,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649853537] [2019-12-27 03:32:04,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:32:04,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:04,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:32:04,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:32:04,338 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-27 03:32:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:04,468 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-27 03:32:04,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:32:04,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:32:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:04,539 INFO L225 Difference]: With dead ends: 36985 [2019-12-27 03:32:04,539 INFO L226 Difference]: Without dead ends: 36985 [2019-12-27 03:32:04,540 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:32:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-27 03:32:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-27 03:32:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-27 03:32:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-27 03:32:06,633 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-27 03:32:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:06,634 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-27 03:32:06,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:32:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-27 03:32:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:32:06,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:06,638 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:32:06,638 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:06,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:06,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-27 03:32:06,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:06,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139545522] [2019-12-27 03:32:06,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:06,729 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:06,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139545522] [2019-12-27 03:32:06,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:06,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:32:06,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108000384] [2019-12-27 03:32:06,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:32:06,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:06,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:32:06,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:32:06,731 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-27 03:32:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:07,517 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-27 03:32:07,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:32:07,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 03:32:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:07,599 INFO L225 Difference]: With dead ends: 50257 [2019-12-27 03:32:07,599 INFO L226 Difference]: Without dead ends: 50244 [2019-12-27 03:32:07,600 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:32:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-27 03:32:08,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-27 03:32:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-27 03:32:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-27 03:32:08,318 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-27 03:32:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:08,318 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-27 03:32:08,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:32:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-27 03:32:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:32:08,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:08,329 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:32:08,330 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:08,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-27 03:32:08,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:08,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597584684] [2019-12-27 03:32:08,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:08,391 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:08,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597584684] [2019-12-27 03:32:08,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:08,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:32:08,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826650898] [2019-12-27 03:32:08,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:32:08,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:08,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:32:08,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:32:08,394 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-27 03:32:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:08,436 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-27 03:32:08,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:32:08,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:32:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:08,448 INFO L225 Difference]: With dead ends: 7104 [2019-12-27 03:32:08,448 INFO L226 Difference]: Without dead ends: 7104 [2019-12-27 03:32:08,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:32:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-27 03:32:08,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-27 03:32:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-27 03:32:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-27 03:32:08,550 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-27 03:32:08,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:08,550 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-27 03:32:08,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:32:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-27 03:32:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 03:32:08,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:08,561 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] [2019-12-27 03:32:08,561 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-27 03:32:08,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:08,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733493123] [2019-12-27 03:32:08,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:08,650 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:08,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733493123] [2019-12-27 03:32:08,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:08,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:32:08,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138129164] [2019-12-27 03:32:08,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:32:08,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:08,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:32:08,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:32:08,653 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-27 03:32:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:10,304 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-27 03:32:10,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:32:10,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 03:32:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:10,312 INFO L225 Difference]: With dead ends: 5024 [2019-12-27 03:32:10,313 INFO L226 Difference]: Without dead ends: 5024 [2019-12-27 03:32:10,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:32:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-27 03:32:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-27 03:32:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-27 03:32:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-27 03:32:10,403 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-27 03:32:10,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:10,404 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-27 03:32:10,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:32:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-27 03:32:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:32:10,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:10,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:10,414 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:10,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-27 03:32:10,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:10,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515633252] [2019-12-27 03:32:10,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:10,488 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:10,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515633252] [2019-12-27 03:32:10,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:10,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:32:10,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089443274] [2019-12-27 03:32:10,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:32:10,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:10,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:32:10,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:32:10,490 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-27 03:32:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:10,551 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-27 03:32:10,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:32:10,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:32:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:10,558 INFO L225 Difference]: With dead ends: 4669 [2019-12-27 03:32:10,558 INFO L226 Difference]: Without dead ends: 4669 [2019-12-27 03:32:10,558 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:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-27 03:32:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-27 03:32:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 03:32:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-27 03:32:10,619 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-27 03:32:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:10,619 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-27 03:32:10,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:32:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-27 03:32:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:32:10,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:10,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:10,627 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:10,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:10,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-27 03:32:10,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:10,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139880745] [2019-12-27 03:32:10,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:10,722 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:10,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139880745] [2019-12-27 03:32:10,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:10,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:32:10,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569764440] [2019-12-27 03:32:10,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:32:10,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:10,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:32:10,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:32:10,725 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-27 03:32:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:10,776 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-27 03:32:10,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:32:10,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:32:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:10,784 INFO L225 Difference]: With dead ends: 4669 [2019-12-27 03:32:10,785 INFO L226 Difference]: Without dead ends: 4669 [2019-12-27 03:32:10,785 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:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-27 03:32:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-27 03:32:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 03:32:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-27 03:32:10,871 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-27 03:32:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:10,871 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-27 03:32:10,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:32:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-27 03:32:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:32:10,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:10,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:10,881 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:10,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-27 03:32:10,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:10,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512593061] [2019-12-27 03:32:10,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:11,027 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:11,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512593061] [2019-12-27 03:32:11,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:11,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:32:11,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59469339] [2019-12-27 03:32:11,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:32:11,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:11,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:32:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:32:11,031 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 6 states. [2019-12-27 03:32:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:11,643 INFO L93 Difference]: Finished difference Result 8765 states and 25085 transitions. [2019-12-27 03:32:11,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:32:11,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 03:32:11,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:11,658 INFO L225 Difference]: With dead ends: 8765 [2019-12-27 03:32:11,658 INFO L226 Difference]: Without dead ends: 8765 [2019-12-27 03:32:11,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:32:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8765 states. [2019-12-27 03:32:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8765 to 5421. [2019-12-27 03:32:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-27 03:32:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15667 transitions. [2019-12-27 03:32:11,798 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 15667 transitions. Word has length 65 [2019-12-27 03:32:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:11,798 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 15667 transitions. [2019-12-27 03:32:11,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:32:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 15667 transitions. [2019-12-27 03:32:11,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:32:11,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:11,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:11,809 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:11,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:11,810 INFO L82 PathProgramCache]: Analyzing trace with hash -191494421, now seen corresponding path program 2 times [2019-12-27 03:32:11,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:11,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907459226] [2019-12-27 03:32:11,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:11,949 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:11,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907459226] [2019-12-27 03:32:11,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:11,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:32:11,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063314329] [2019-12-27 03:32:11,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:32:11,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:11,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:32:11,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:32:11,952 INFO L87 Difference]: Start difference. First operand 5421 states and 15667 transitions. Second operand 5 states. [2019-12-27 03:32:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:12,340 INFO L93 Difference]: Finished difference Result 7981 states and 22730 transitions. [2019-12-27 03:32:12,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:32:12,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 03:32:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:12,353 INFO L225 Difference]: With dead ends: 7981 [2019-12-27 03:32:12,353 INFO L226 Difference]: Without dead ends: 7981 [2019-12-27 03:32:12,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 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:32:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7981 states. [2019-12-27 03:32:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7981 to 5923. [2019-12-27 03:32:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5923 states. [2019-12-27 03:32:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5923 states to 5923 states and 17159 transitions. [2019-12-27 03:32:12,469 INFO L78 Accepts]: Start accepts. Automaton has 5923 states and 17159 transitions. Word has length 65 [2019-12-27 03:32:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:12,470 INFO L462 AbstractCegarLoop]: Abstraction has 5923 states and 17159 transitions. [2019-12-27 03:32:12,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:32:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5923 states and 17159 transitions. [2019-12-27 03:32:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:32:12,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:12,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:12,479 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:12,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash 147719209, now seen corresponding path program 3 times [2019-12-27 03:32:12,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:12,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722247077] [2019-12-27 03:32:12,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:12,539 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:12,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722247077] [2019-12-27 03:32:12,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:12,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:32:12,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230653994] [2019-12-27 03:32:12,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:32:12,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:12,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:32:12,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:32:12,542 INFO L87 Difference]: Start difference. First operand 5923 states and 17159 transitions. Second operand 3 states. [2019-12-27 03:32:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:12,570 INFO L93 Difference]: Finished difference Result 5119 states and 14578 transitions. [2019-12-27 03:32:12,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:32:12,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:32:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:12,578 INFO L225 Difference]: With dead ends: 5119 [2019-12-27 03:32:12,578 INFO L226 Difference]: Without dead ends: 5119 [2019-12-27 03:32:12,579 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:32:12,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-12-27 03:32:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 4839. [2019-12-27 03:32:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4839 states. [2019-12-27 03:32:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 13806 transitions. [2019-12-27 03:32:12,667 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 13806 transitions. Word has length 65 [2019-12-27 03:32:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:12,668 INFO L462 AbstractCegarLoop]: Abstraction has 4839 states and 13806 transitions. [2019-12-27 03:32:12,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:32:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 13806 transitions. [2019-12-27 03:32:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:32:12,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:12,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:12,677 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:12,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:12,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2002555555, now seen corresponding path program 1 times [2019-12-27 03:32:12,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:12,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204051009] [2019-12-27 03:32:12,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:12,750 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:12,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204051009] [2019-12-27 03:32:12,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:12,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:32:12,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308346534] [2019-12-27 03:32:12,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:32:12,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:12,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:32:12,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:32:12,752 INFO L87 Difference]: Start difference. First operand 4839 states and 13806 transitions. Second operand 3 states. [2019-12-27 03:32:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:12,778 INFO L93 Difference]: Finished difference Result 4413 states and 12340 transitions. [2019-12-27 03:32:12,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:32:12,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 03:32:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:12,786 INFO L225 Difference]: With dead ends: 4413 [2019-12-27 03:32:12,786 INFO L226 Difference]: Without dead ends: 4413 [2019-12-27 03:32:12,786 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:32:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2019-12-27 03:32:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4413. [2019-12-27 03:32:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4413 states. [2019-12-27 03:32:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 12340 transitions. [2019-12-27 03:32:12,871 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 12340 transitions. Word has length 66 [2019-12-27 03:32:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:12,871 INFO L462 AbstractCegarLoop]: Abstraction has 4413 states and 12340 transitions. [2019-12-27 03:32:12,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:32:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 12340 transitions. [2019-12-27 03:32:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:32:12,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:12,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:12,880 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1724172683, now seen corresponding path program 1 times [2019-12-27 03:32:12,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:12,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633706615] [2019-12-27 03:32:12,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:12,957 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:12,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633706615] [2019-12-27 03:32:12,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:12,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:32:12,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442032156] [2019-12-27 03:32:12,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:32:12,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:12,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:32:12,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:32:12,959 INFO L87 Difference]: Start difference. First operand 4413 states and 12340 transitions. Second operand 5 states. [2019-12-27 03:32:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:13,255 INFO L93 Difference]: Finished difference Result 6679 states and 18593 transitions. [2019-12-27 03:32:13,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:32:13,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-27 03:32:13,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:13,264 INFO L225 Difference]: With dead ends: 6679 [2019-12-27 03:32:13,265 INFO L226 Difference]: Without dead ends: 6679 [2019-12-27 03:32:13,265 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:32:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2019-12-27 03:32:13,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 5169. [2019-12-27 03:32:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5169 states. [2019-12-27 03:32:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5169 states to 5169 states and 14506 transitions. [2019-12-27 03:32:13,388 INFO L78 Accepts]: Start accepts. Automaton has 5169 states and 14506 transitions. Word has length 67 [2019-12-27 03:32:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:13,388 INFO L462 AbstractCegarLoop]: Abstraction has 5169 states and 14506 transitions. [2019-12-27 03:32:13,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:32:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 5169 states and 14506 transitions. [2019-12-27 03:32:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:32:13,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:13,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:13,398 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:13,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:13,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1093155317, now seen corresponding path program 2 times [2019-12-27 03:32:13,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:13,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052069843] [2019-12-27 03:32:13,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:13,500 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:13,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052069843] [2019-12-27 03:32:13,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:13,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:32:13,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281025033] [2019-12-27 03:32:13,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:32:13,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:13,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:32:13,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:32:13,503 INFO L87 Difference]: Start difference. First operand 5169 states and 14506 transitions. Second operand 7 states. [2019-12-27 03:32:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:13,969 INFO L93 Difference]: Finished difference Result 7114 states and 19697 transitions. [2019-12-27 03:32:13,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:32:13,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 03:32:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:13,979 INFO L225 Difference]: With dead ends: 7114 [2019-12-27 03:32:13,980 INFO L226 Difference]: Without dead ends: 7114 [2019-12-27 03:32:13,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:32:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7114 states. [2019-12-27 03:32:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7114 to 5330. [2019-12-27 03:32:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5330 states. [2019-12-27 03:32:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5330 states to 5330 states and 14959 transitions. [2019-12-27 03:32:14,065 INFO L78 Accepts]: Start accepts. Automaton has 5330 states and 14959 transitions. Word has length 67 [2019-12-27 03:32:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:14,066 INFO L462 AbstractCegarLoop]: Abstraction has 5330 states and 14959 transitions. [2019-12-27 03:32:14,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:32:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 5330 states and 14959 transitions. [2019-12-27 03:32:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:32:14,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:14,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:14,073 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:14,074 INFO L82 PathProgramCache]: Analyzing trace with hash -346409133, now seen corresponding path program 3 times [2019-12-27 03:32:14,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:14,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874221221] [2019-12-27 03:32:14,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:14,274 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,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874221221] [2019-12-27 03:32:14,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:14,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:32:14,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028060525] [2019-12-27 03:32:14,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:32:14,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:14,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:32:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:32:14,276 INFO L87 Difference]: Start difference. First operand 5330 states and 14959 transitions. Second operand 9 states. [2019-12-27 03:32:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:15,354 INFO L93 Difference]: Finished difference Result 11679 states and 32002 transitions. [2019-12-27 03:32:15,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 03:32:15,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 03:32:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:15,369 INFO L225 Difference]: With dead ends: 11679 [2019-12-27 03:32:15,369 INFO L226 Difference]: Without dead ends: 11679 [2019-12-27 03:32:15,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-12-27 03:32:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11679 states. [2019-12-27 03:32:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11679 to 5596. [2019-12-27 03:32:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5596 states. [2019-12-27 03:32:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 15704 transitions. [2019-12-27 03:32:15,484 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 15704 transitions. Word has length 67 [2019-12-27 03:32:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:15,484 INFO L462 AbstractCegarLoop]: Abstraction has 5596 states and 15704 transitions. [2019-12-27 03:32:15,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:32:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 15704 transitions. [2019-12-27 03:32:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:32:15,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:15,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:15,493 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1430541189, now seen corresponding path program 4 times [2019-12-27 03:32:15,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:15,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546288841] [2019-12-27 03:32:15,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:15,628 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:15,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546288841] [2019-12-27 03:32:15,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:15,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:32:15,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456104804] [2019-12-27 03:32:15,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:32:15,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:32:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:32:15,630 INFO L87 Difference]: Start difference. First operand 5596 states and 15704 transitions. Second operand 7 states. [2019-12-27 03:32:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:15,895 INFO L93 Difference]: Finished difference Result 18135 states and 50995 transitions. [2019-12-27 03:32:15,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:32:15,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 03:32:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:15,915 INFO L225 Difference]: With dead ends: 18135 [2019-12-27 03:32:15,916 INFO L226 Difference]: Without dead ends: 11006 [2019-12-27 03:32:15,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:32:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11006 states. [2019-12-27 03:32:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11006 to 5596. [2019-12-27 03:32:16,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5596 states. [2019-12-27 03:32:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 15635 transitions. [2019-12-27 03:32:16,093 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 15635 transitions. Word has length 67 [2019-12-27 03:32:16,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:16,094 INFO L462 AbstractCegarLoop]: Abstraction has 5596 states and 15635 transitions. [2019-12-27 03:32:16,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:32:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 15635 transitions. [2019-12-27 03:32:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:32:16,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:16,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:16,104 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:16,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:16,104 INFO L82 PathProgramCache]: Analyzing trace with hash 173931463, now seen corresponding path program 5 times [2019-12-27 03:32:16,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:16,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026522605] [2019-12-27 03:32:16,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:16,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:32:16,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026522605] [2019-12-27 03:32:16,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:16,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:32:16,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411290075] [2019-12-27 03:32:16,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:32:16,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:16,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:32:16,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:32:16,216 INFO L87 Difference]: Start difference. First operand 5596 states and 15635 transitions. Second operand 6 states. [2019-12-27 03:32:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:16,324 INFO L93 Difference]: Finished difference Result 9430 states and 26360 transitions. [2019-12-27 03:32:16,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:32:16,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 03:32:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:16,330 INFO L225 Difference]: With dead ends: 9430 [2019-12-27 03:32:16,330 INFO L226 Difference]: Without dead ends: 4078 [2019-12-27 03:32:16,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:32:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2019-12-27 03:32:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 3460. [2019-12-27 03:32:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3460 states. [2019-12-27 03:32:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 9593 transitions. [2019-12-27 03:32:16,404 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 9593 transitions. Word has length 67 [2019-12-27 03:32:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:16,404 INFO L462 AbstractCegarLoop]: Abstraction has 3460 states and 9593 transitions. [2019-12-27 03:32:16,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:32:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 9593 transitions. [2019-12-27 03:32:16,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:32:16,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:16,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:16,409 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:16,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:16,410 INFO L82 PathProgramCache]: Analyzing trace with hash -378425991, now seen corresponding path program 6 times [2019-12-27 03:32:16,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:16,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179496614] [2019-12-27 03:32:16,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:16,604 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:16,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179496614] [2019-12-27 03:32:16,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:16,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:32:16,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772101929] [2019-12-27 03:32:16,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:32:16,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:16,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:32:16,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:32:16,606 INFO L87 Difference]: Start difference. First operand 3460 states and 9593 transitions. Second operand 10 states. [2019-12-27 03:32:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:17,406 INFO L93 Difference]: Finished difference Result 6473 states and 17519 transitions. [2019-12-27 03:32:17,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:32:17,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 03:32:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:17,415 INFO L225 Difference]: With dead ends: 6473 [2019-12-27 03:32:17,415 INFO L226 Difference]: Without dead ends: 6473 [2019-12-27 03:32:17,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:32:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6473 states. [2019-12-27 03:32:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6473 to 3418. [2019-12-27 03:32:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3418 states. [2019-12-27 03:32:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 9424 transitions. [2019-12-27 03:32:17,480 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 9424 transitions. Word has length 67 [2019-12-27 03:32:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:17,480 INFO L462 AbstractCegarLoop]: Abstraction has 3418 states and 9424 transitions. [2019-12-27 03:32:17,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:32:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 9424 transitions. [2019-12-27 03:32:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:32:17,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:17,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:17,484 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:17,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2109267181, now seen corresponding path program 7 times [2019-12-27 03:32:17,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:17,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930335919] [2019-12-27 03:32:17,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:17,545 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:17,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930335919] [2019-12-27 03:32:17,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:17,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:32:17,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791495900] [2019-12-27 03:32:17,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:32:17,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:17,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:32:17,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:32:17,547 INFO L87 Difference]: Start difference. First operand 3418 states and 9424 transitions. Second operand 3 states. [2019-12-27 03:32:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:17,594 INFO L93 Difference]: Finished difference Result 3418 states and 9423 transitions. [2019-12-27 03:32:17,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:32:17,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 03:32:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:17,599 INFO L225 Difference]: With dead ends: 3418 [2019-12-27 03:32:17,599 INFO L226 Difference]: Without dead ends: 3418 [2019-12-27 03:32:17,600 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:32:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2019-12-27 03:32:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 1984. [2019-12-27 03:32:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1984 states. [2019-12-27 03:32:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 5409 transitions. [2019-12-27 03:32:17,651 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 5409 transitions. Word has length 67 [2019-12-27 03:32:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:17,651 INFO L462 AbstractCegarLoop]: Abstraction has 1984 states and 5409 transitions. [2019-12-27 03:32:17,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:32:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 5409 transitions. [2019-12-27 03:32:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:32:17,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:17,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:17,654 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:17,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:17,655 INFO L82 PathProgramCache]: Analyzing trace with hash -213601006, now seen corresponding path program 1 times [2019-12-27 03:32:17,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:17,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155539751] [2019-12-27 03:32:17,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:32:17,804 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:17,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155539751] [2019-12-27 03:32:17,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:32:17,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:32:17,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649046933] [2019-12-27 03:32:17,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:32:17,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:32:17,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:32:17,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:32:17,807 INFO L87 Difference]: Start difference. First operand 1984 states and 5409 transitions. Second operand 7 states. [2019-12-27 03:32:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:32:17,900 INFO L93 Difference]: Finished difference Result 4122 states and 11349 transitions. [2019-12-27 03:32:17,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:32:17,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 03:32:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:32:17,904 INFO L225 Difference]: With dead ends: 4122 [2019-12-27 03:32:17,904 INFO L226 Difference]: Without dead ends: 2179 [2019-12-27 03:32:17,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:32:17,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2179 states. [2019-12-27 03:32:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2179 to 1792. [2019-12-27 03:32:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-12-27 03:32:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 4902 transitions. [2019-12-27 03:32:17,944 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 4902 transitions. Word has length 68 [2019-12-27 03:32:17,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:32:17,944 INFO L462 AbstractCegarLoop]: Abstraction has 1792 states and 4902 transitions. [2019-12-27 03:32:17,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:32:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 4902 transitions. [2019-12-27 03:32:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:32:17,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:32:17,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:32:17,947 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:32:17,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:32:17,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 2 times [2019-12-27 03:32:17,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:32:17,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145958890] [2019-12-27 03:32:17,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:32:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:32:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:32:18,101 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:32:18,102 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:32:18,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1888~0.base_20|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1888~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1888~0.base_20|) |v_ULTIMATE.start_main_~#t1888~0.offset_17| 0))) (= 0 v_~x$w_buff0~0_268) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_187 0) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~x$r_buff0_thd0~0_372 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff1_thd3~0_195) (= 0 v_~x$r_buff0_thd3~0_123) (= |v_#NULL.offset_4| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1888~0.base_20| 4)) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x$r_buff0_thd1~0_120 0) (= 0 |v_ULTIMATE.start_main_~#t1888~0.offset_17|) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1888~0.base_20| 1)) (= 0 v_~__unbuffered_p2_EAX~0_22) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_110 0) (= v_~y~0_136 0) (= 0 v_~x$w_buff0_used~0_807) (= (select .cse0 |v_ULTIMATE.start_main_~#t1888~0.base_20|) 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_~#t1890~0.offset=|v_ULTIMATE.start_main_~#t1890~0.offset_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_~#t1888~0.base=|v_ULTIMATE.start_main_~#t1888~0.base_20|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y~0=v_~y~0_136, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1888~0.offset=|v_ULTIMATE.start_main_~#t1888~0.offset_17|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1890~0.base=|v_ULTIMATE.start_main_~#t1890~0.base_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t1889~0.offset=|v_ULTIMATE.start_main_~#t1889~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ULTIMATE.start_main_~#t1889~0.base=|v_ULTIMATE.start_main_~#t1889~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1890~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1888~0.base, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1888~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1890~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1889~0.offset, ~weak$$choice2~0, ULTIMATE.start_main_~#t1889~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:32:18,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1889~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1889~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1889~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1889~0.base_11|) |v_ULTIMATE.start_main_~#t1889~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1889~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1889~0.base_11| 1)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1889~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1889~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1889~0.offset=|v_ULTIMATE.start_main_~#t1889~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1889~0.base=|v_ULTIMATE.start_main_~#t1889~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t1889~0.offset, #length, ULTIMATE.start_main_~#t1889~0.base] because there is no mapped edge [2019-12-27 03:32:18,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1890~0.base_9|) 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1890~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1890~0.base_9|) |v_ULTIMATE.start_main_~#t1890~0.offset_8| 2)) |v_#memory_int_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1890~0.base_9|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1890~0.base_9| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1890~0.base_9| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1890~0.base_9|) (= 0 |v_ULTIMATE.start_main_~#t1890~0.offset_8|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1890~0.base=|v_ULTIMATE.start_main_~#t1890~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1890~0.offset=|v_ULTIMATE.start_main_~#t1890~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1890~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1890~0.offset] because there is no mapped edge [2019-12-27 03:32:18,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 03:32:18,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1366004394 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1366004394 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out1366004394| ~x~0_In1366004394) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out1366004394| ~x$w_buff1~0_In1366004394) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1366004394, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1366004394, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1366004394, ~x~0=~x~0_In1366004394} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1366004394|, ~x$w_buff1~0=~x$w_buff1~0_In1366004394, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1366004394, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1366004394, ~x~0=~x~0_In1366004394} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 03:32:18,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 03:32:18,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1082164759 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1082164759 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1082164759| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1082164759| ~x$w_buff0_used~0_In-1082164759) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1082164759, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1082164759} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1082164759, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1082164759|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1082164759} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 03:32:18,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In935551585 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In935551585 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In935551585 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In935551585 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out935551585| 0)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out935551585| ~x$w_buff1_used~0_In935551585) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In935551585, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In935551585, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In935551585, ~x$w_buff0_used~0=~x$w_buff0_used~0_In935551585} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In935551585, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In935551585, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In935551585, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out935551585|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In935551585} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 03:32:18,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In2097990348 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In2097990348 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out2097990348| |P0Thread1of1ForFork0_#t~ite3_Out2097990348|))) (or (and .cse0 (not .cse1) (= ~x$w_buff1~0_In2097990348 |P0Thread1of1ForFork0_#t~ite3_Out2097990348|) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~x~0_In2097990348 |P0Thread1of1ForFork0_#t~ite3_Out2097990348|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2097990348, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2097990348, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2097990348, ~x~0=~x~0_In2097990348} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out2097990348|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out2097990348|, ~x$w_buff1~0=~x$w_buff1~0_In2097990348, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2097990348, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2097990348, ~x~0=~x~0_In2097990348} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 03:32:18,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1185175411 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1185175411 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1185175411 |P0Thread1of1ForFork0_#t~ite5_Out1185175411|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1185175411| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1185175411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1185175411} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1185175411|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1185175411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1185175411} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:32:18,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In-1376716317 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1376716317 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1376716317 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1376716317 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1376716317 |P0Thread1of1ForFork0_#t~ite6_Out-1376716317|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1376716317|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1376716317, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1376716317, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1376716317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376716317} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1376716317|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1376716317, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1376716317, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1376716317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376716317} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:32:18,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In2136060209 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2136060209 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out2136060209| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out2136060209| ~x$r_buff0_thd3~0_In2136060209)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2136060209, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2136060209} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2136060209, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out2136060209|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2136060209} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 03:32:18,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In950653118 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In950653118 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In950653118 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In950653118 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In950653118 |P2Thread1of1ForFork2_#t~ite20_Out950653118|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite20_Out950653118| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In950653118, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In950653118, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In950653118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In950653118} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out950653118|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In950653118, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In950653118, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In950653118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In950653118} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 03:32:18,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 03:32:18,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-327111166 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-327111166 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-327111166| ~x$r_buff0_thd1~0_In-327111166)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out-327111166| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-327111166, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-327111166} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-327111166, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-327111166|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-327111166} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 03:32:18,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-897684928 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-897684928 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-897684928 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-897684928 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-897684928| ~x$r_buff1_thd1~0_In-897684928) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-897684928| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-897684928, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-897684928, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-897684928, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-897684928} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-897684928, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-897684928|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-897684928, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-897684928, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-897684928} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:32:18,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_61} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 03:32:18,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In943277291 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In943277291 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out943277291| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out943277291| ~x$w_buff0_used~0_In943277291)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In943277291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In943277291} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out943277291|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In943277291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In943277291} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:32:18,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1546334785 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1546334785 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1546334785 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1546334785 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1546334785 |P1Thread1of1ForFork1_#t~ite12_Out-1546334785|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1546334785|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1546334785, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1546334785, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1546334785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1546334785} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1546334785, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1546334785, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1546334785|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1546334785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1546334785} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:32:18,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In135737531 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In135737531 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out135737531) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In135737531 ~x$r_buff0_thd2~0_Out135737531) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In135737531, ~x$w_buff0_used~0=~x$w_buff0_used~0_In135737531} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out135737531|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out135737531, ~x$w_buff0_used~0=~x$w_buff0_used~0_In135737531} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:32:18,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1666984628 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1666984628 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1666984628 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1666984628 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1666984628| ~x$r_buff1_thd2~0_In1666984628) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1666984628|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1666984628, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1666984628, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1666984628, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1666984628} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1666984628, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1666984628, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1666984628, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1666984628|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1666984628} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:32:18,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:32:18,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:32:18,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1484150028 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1484150028 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out-1484150028| |ULTIMATE.start_main_#t~ite24_Out-1484150028|))) (or (and (= ~x$w_buff1~0_In-1484150028 |ULTIMATE.start_main_#t~ite24_Out-1484150028|) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite24_Out-1484150028| ~x~0_In-1484150028) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1484150028, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1484150028, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1484150028, ~x~0=~x~0_In-1484150028} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1484150028, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1484150028|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1484150028|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1484150028, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1484150028, ~x~0=~x~0_In-1484150028} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 03:32:18,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-669264230 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-669264230 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out-669264230| 0)) (and (= ~x$w_buff0_used~0_In-669264230 |ULTIMATE.start_main_#t~ite26_Out-669264230|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-669264230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-669264230} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-669264230, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-669264230|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-669264230} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 03:32:18,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1667559447 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1667559447 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1667559447 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1667559447 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out1667559447| ~x$w_buff1_used~0_In1667559447) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out1667559447| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1667559447, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1667559447, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1667559447, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1667559447} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1667559447, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1667559447, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1667559447|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1667559447, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1667559447} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 03:32:18,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In956141338 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In956141338 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In956141338 |ULTIMATE.start_main_#t~ite28_Out956141338|)) (and (= |ULTIMATE.start_main_#t~ite28_Out956141338| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In956141338, ~x$w_buff0_used~0=~x$w_buff0_used~0_In956141338} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In956141338, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out956141338|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In956141338} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 03:32:18,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-1826116693 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1826116693 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1826116693 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1826116693 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-1826116693| ~x$r_buff1_thd0~0_In-1826116693)) (and (= |ULTIMATE.start_main_#t~ite29_Out-1826116693| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1826116693, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1826116693, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1826116693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1826116693} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1826116693, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1826116693|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1826116693, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1826116693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1826116693} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 03:32:18,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 03:32:18,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:32:18,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:32:18,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:32:18 BasicIcfg [2019-12-27 03:32:18,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:32:18,255 INFO L168 Benchmark]: Toolchain (without parser) took 85401.40 ms. Allocated memory was 144.7 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 102.4 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 385.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:32:18,256 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 122.7 MB in the beginning and 122.5 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:32:18,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.15 ms. Allocated memory was 144.7 MB in the beginning and 203.9 MB in the end (delta: 59.2 MB). Free memory was 102.0 MB in the beginning and 157.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:32:18,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.44 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.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:32:18,258 INFO L168 Benchmark]: Boogie Preprocessor took 40.02 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.0 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:32:18,259 INFO L168 Benchmark]: RCFGBuilder took 845.32 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 102.2 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:32:18,259 INFO L168 Benchmark]: TraceAbstraction took 83644.68 ms. Allocated memory was 203.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.6 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 325.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:32:18,262 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.20 ms. Allocated memory is still 144.7 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.15 ms. Allocated memory was 144.7 MB in the beginning and 203.9 MB in the end (delta: 59.2 MB). Free memory was 102.0 MB in the beginning and 157.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.44 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.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 40.02 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 845.32 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 102.2 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83644.68 ms. Allocated memory was 203.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.6 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 325.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L807] FCALL, FORK 0 pthread_create(&t1889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L809] FCALL, FORK 0 pthread_create(&t1890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 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_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=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 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 [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] 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 [\result={0:0}, __unbuffered_cnt=1, __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=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 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 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 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 [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, x$flush_delayed=1, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 83.3s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3159 SDtfs, 2806 SDslu, 6274 SDs, 0 SdLazy, 3738 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 52 SyntacticMatches, 14 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 89627 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1119 NumberOfCodeBlocks, 1119 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1030 ConstructedInterpolants, 0 QuantifiedInterpolants, 186193 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...