/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/mix024_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:53:20,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:53:20,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:53:20,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:53:20,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:53:20,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:53:20,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:53:20,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:53:20,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:53:20,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:53:20,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:53:20,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:53:20,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:53:20,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:53:20,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:53:20,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:53:20,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:53:20,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:53:20,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:53:20,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:53:20,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:53:20,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:53:20,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:53:20,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:53:20,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:53:20,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:53:20,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:53:20,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:53:20,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:53:20,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:53:20,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:53:20,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:53:20,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:53:20,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:53:20,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:53:20,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:53:20,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:53:20,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:53:20,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:53:20,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:53:20,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:53:20,672 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:53:20,702 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:53:20,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:53:20,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:53:20,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:53:20,706 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:53:20,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:53:20,706 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:53:20,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:53:20,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:53:20,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:53:20,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:53:20,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:53:20,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:53:20,709 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:53:20,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:53:20,709 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:53:20,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:53:20,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:53:20,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:53:20,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:53:20,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:53:20,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:53:20,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:53:20,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:53:20,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:53:20,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:53:20,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:53:20,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:53:20,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:53:21,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:53:21,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:53:21,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:53:21,030 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:53:21,030 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:53:21,031 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i [2019-12-27 01:53:21,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97ca10893/5f8e7eae55714481811a083bbf034108/FLAGffafda8a8 [2019-12-27 01:53:21,722 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:53:21,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i [2019-12-27 01:53:21,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97ca10893/5f8e7eae55714481811a083bbf034108/FLAGffafda8a8 [2019-12-27 01:53:21,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97ca10893/5f8e7eae55714481811a083bbf034108 [2019-12-27 01:53:21,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:53:21,969 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:53:21,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:53:21,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:53:21,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:53:21,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:53:21" (1/1) ... [2019-12-27 01:53:21,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113399e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:21, skipping insertion in model container [2019-12-27 01:53:21,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:53:21" (1/1) ... [2019-12-27 01:53:21,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:53:22,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:53:22,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:53:22,543 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:53:22,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:53:22,721 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:53:22,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:22 WrapperNode [2019-12-27 01:53:22,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:53:22,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:53:22,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:53:22,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:53:22,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:22" (1/1) ... [2019-12-27 01:53:22,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:22" (1/1) ... [2019-12-27 01:53:22,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:53:22,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:53:22,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:53:22,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:53:22,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:22" (1/1) ... [2019-12-27 01:53:22,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:22" (1/1) ... [2019-12-27 01:53:22,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:22" (1/1) ... [2019-12-27 01:53:22,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:22" (1/1) ... [2019-12-27 01:53:22,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:22" (1/1) ... [2019-12-27 01:53:22,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:22" (1/1) ... [2019-12-27 01:53:22,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:22" (1/1) ... [2019-12-27 01:53:22,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:53:22,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:53:22,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:53:22,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:53:22,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:53:22,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:53:22,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:53:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:53:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:53:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:53:22,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:53:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:53:22,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:53:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:53:22,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:53:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:53:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:53:22,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:53:22,919 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:53:23,637 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:53:23,638 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:53:23,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:53:23 BoogieIcfgContainer [2019-12-27 01:53:23,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:53:23,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:53:23,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:53:23,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:53:23,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:53:21" (1/3) ... [2019-12-27 01:53:23,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ece1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:53:23, skipping insertion in model container [2019-12-27 01:53:23,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:53:22" (2/3) ... [2019-12-27 01:53:23,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ece1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:53:23, skipping insertion in model container [2019-12-27 01:53:23,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:53:23" (3/3) ... [2019-12-27 01:53:23,651 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_power.opt.i [2019-12-27 01:53:23,662 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:53:23,663 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:53:23,672 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:53:23,673 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:53:23,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,714 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,715 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,738 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,766 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,767 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,768 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,768 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,774 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,774 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,784 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,786 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,793 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,793 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,794 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,801 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,801 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:53:23,818 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:53:23,843 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:53:23,843 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:53:23,843 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:53:23,843 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:53:23,843 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:53:23,844 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:53:23,844 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:53:23,844 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:53:23,861 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 01:53:23,863 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 01:53:23,991 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 01:53:23,991 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:53:24,011 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 01:53:24,033 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 01:53:24,098 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 01:53:24,098 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:53:24,105 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 01:53:24,125 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 01:53:24,127 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:53:28,020 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-12-27 01:53:30,118 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 01:53:30,252 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 01:53:30,271 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74173 [2019-12-27 01:53:30,272 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 01:53:30,280 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-27 01:53:40,152 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-27 01:53:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-27 01:53:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 01:53:40,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:53:40,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 01:53:40,162 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 01:53:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:53:40,168 INFO L82 PathProgramCache]: Analyzing trace with hash 803939489, now seen corresponding path program 1 times [2019-12-27 01:53:40,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:53:40,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720367458] [2019-12-27 01:53:40,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:53:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:53:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:53:40,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720367458] [2019-12-27 01:53:40,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:53:40,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:53:40,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393754671] [2019-12-27 01:53:40,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:53:40,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:53:40,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:53:40,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:53:40,475 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-27 01:53:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:53:41,861 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-27 01:53:41,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:53:41,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 01:53:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:53:44,680 INFO L225 Difference]: With dead ends: 81762 [2019-12-27 01:53:44,681 INFO L226 Difference]: Without dead ends: 77082 [2019-12-27 01:53:44,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:53:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-27 01:53:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-27 01:53:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-27 01:53:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-27 01:53:50,411 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-27 01:53:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:53:50,411 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-27 01:53:50,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:53:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-27 01:53:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:53:50,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:53:50,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:53:50,421 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 01:53:50,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:53:50,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1596901179, now seen corresponding path program 1 times [2019-12-27 01:53:50,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:53:50,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478088565] [2019-12-27 01:53:50,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:53:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:53:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:53:50,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478088565] [2019-12-27 01:53:50,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:53:50,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:53:50,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867885714] [2019-12-27 01:53:50,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:53:50,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:53:50,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:53:50,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:53:50,494 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-27 01:53:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:53:50,746 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-27 01:53:50,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:53:50,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:53:50,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:53:50,853 INFO L225 Difference]: With dead ends: 20478 [2019-12-27 01:53:50,853 INFO L226 Difference]: Without dead ends: 20478 [2019-12-27 01:53:50,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:53:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-27 01:53:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-27 01:53:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 01:53:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-27 01:53:51,418 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-27 01:53:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:53:51,418 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-27 01:53:51,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:53:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-27 01:53:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:53:51,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:53:51,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:53:51,421 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 01:53:51,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:53:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1662041210, now seen corresponding path program 1 times [2019-12-27 01:53:51,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:53:51,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545062221] [2019-12-27 01:53:51,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:53:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:53:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:53:51,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545062221] [2019-12-27 01:53:51,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:53:51,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:53:51,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132800624] [2019-12-27 01:53:51,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:53:51,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:53:51,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:53:51,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:53:51,501 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-27 01:53:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:53:53,312 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-27 01:53:53,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:53:53,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 01:53:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:53:53,368 INFO L225 Difference]: With dead ends: 30802 [2019-12-27 01:53:53,369 INFO L226 Difference]: Without dead ends: 30788 [2019-12-27 01:53:53,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:53:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-27 01:53:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-27 01:53:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-27 01:53:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-27 01:53:54,135 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-27 01:53:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:53:54,135 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-27 01:53:54,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:53:54,136 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-27 01:53:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 01:53:54,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:53:54,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:53:54,139 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 01:53:54,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:53:54,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1480512145, now seen corresponding path program 1 times [2019-12-27 01:53:54,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:53:54,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317910360] [2019-12-27 01:53:54,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:53:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:53:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:53:54,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317910360] [2019-12-27 01:53:54,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:53:54,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:53:54,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533613650] [2019-12-27 01:53:54,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:53:54,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:53:54,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:53:54,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:53:54,274 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-27 01:53:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:53:54,595 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-27 01:53:54,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:53:54,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 01:53:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:53:54,651 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 01:53:54,651 INFO L226 Difference]: Without dead ends: 35512 [2019-12-27 01:53:54,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:53:54,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-27 01:53:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-27 01:53:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-27 01:53:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-27 01:53:55,766 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-27 01:53:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:53:55,767 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-27 01:53:55,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:53:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-27 01:53:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 01:53:55,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:53:55,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:53:55,770 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 01:53:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:53:55,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1480362260, now seen corresponding path program 1 times [2019-12-27 01:53:55,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:53:55,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258513940] [2019-12-27 01:53:55,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:53:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:53:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:53:55,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258513940] [2019-12-27 01:53:55,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:53:55,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:53:55,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994092484] [2019-12-27 01:53:55,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:53:55,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:53:55,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:53:55,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:53:55,865 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-27 01:53:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:53:56,205 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-27 01:53:56,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:53:56,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 01:53:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:53:56,272 INFO L225 Difference]: With dead ends: 38443 [2019-12-27 01:53:56,272 INFO L226 Difference]: Without dead ends: 38432 [2019-12-27 01:53:56,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:53:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-27 01:53:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-27 01:53:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-27 01:53:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-27 01:53:56,923 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-27 01:53:56,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:53:56,923 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-27 01:53:56,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:53:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-27 01:53:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:53:56,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:53:56,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:53:56,934 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 01:53:56,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:53:56,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2067973460, now seen corresponding path program 1 times [2019-12-27 01:53:56,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:53:56,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093036609] [2019-12-27 01:53:56,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:53:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:53:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:53:57,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093036609] [2019-12-27 01:53:57,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:53:57,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:53:57,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148544716] [2019-12-27 01:53:57,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:53:57,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:53:57,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:53:57,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:53:57,019 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-27 01:53:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:53:57,941 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-27 01:53:57,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:53:57,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:53:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:53:58,032 INFO L225 Difference]: With dead ends: 45281 [2019-12-27 01:53:58,032 INFO L226 Difference]: Without dead ends: 45258 [2019-12-27 01:53:58,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:53:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-27 01:53:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-27 01:53:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-27 01:53:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-27 01:53:58,691 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-27 01:53:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:53:58,691 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-27 01:53:58,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:53:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-27 01:53:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:53:58,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:53:58,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:53:58,700 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 01:53:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:53:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2068123345, now seen corresponding path program 1 times [2019-12-27 01:53:58,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:53:58,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205952597] [2019-12-27 01:53:58,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:53:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:53:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:53:58,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205952597] [2019-12-27 01:53:58,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:53:58,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:53:58,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298206203] [2019-12-27 01:53:58,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:53:58,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:53:58,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:53:58,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:53:58,777 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-27 01:53:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:53:59,364 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-27 01:53:59,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:53:59,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:53:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:53:59,444 INFO L225 Difference]: With dead ends: 46044 [2019-12-27 01:53:59,445 INFO L226 Difference]: Without dead ends: 46021 [2019-12-27 01:53:59,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:53:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-27 01:54:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-27 01:54:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-27 01:54:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-27 01:54:00,362 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-27 01:54:00,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:00,362 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-27 01:54:00,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:54:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-27 01:54:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:54:00,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:00,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:54:00,379 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 01:54:00,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:00,380 INFO L82 PathProgramCache]: Analyzing trace with hash 668919418, now seen corresponding path program 1 times [2019-12-27 01:54:00,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:00,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074954952] [2019-12-27 01:54:00,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:00,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074954952] [2019-12-27 01:54:00,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:00,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:54:00,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765041583] [2019-12-27 01:54:00,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:54:00,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:00,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:54:00,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:54:00,430 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-27 01:54:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:00,502 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-27 01:54:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:54:00,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:54:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:00,517 INFO L225 Difference]: With dead ends: 11657 [2019-12-27 01:54:00,518 INFO L226 Difference]: Without dead ends: 11657 [2019-12-27 01:54:00,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:54:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-27 01:54:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-27 01:54:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-27 01:54:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-27 01:54:00,671 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-27 01:54:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:00,671 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-27 01:54:00,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:54:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-27 01:54:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:54:00,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:00,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:54:00,686 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 01:54:00,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:00,687 INFO L82 PathProgramCache]: Analyzing trace with hash 954456655, now seen corresponding path program 1 times [2019-12-27 01:54:00,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:00,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817434038] [2019-12-27 01:54:00,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:00,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817434038] [2019-12-27 01:54:00,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:00,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:54:00,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832282466] [2019-12-27 01:54:00,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:54:00,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:00,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:54:00,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:00,738 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-27 01:54:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:00,821 INFO L93 Difference]: Finished difference Result 15100 states and 45684 transitions. [2019-12-27 01:54:00,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:54:00,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:54:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:00,842 INFO L225 Difference]: With dead ends: 15100 [2019-12-27 01:54:00,842 INFO L226 Difference]: Without dead ends: 15100 [2019-12-27 01:54:00,842 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 01:54:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15100 states. [2019-12-27 01:54:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15100 to 12271. [2019-12-27 01:54:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12271 states. [2019-12-27 01:54:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12271 states to 12271 states and 37679 transitions. [2019-12-27 01:54:01,026 INFO L78 Accepts]: Start accepts. Automaton has 12271 states and 37679 transitions. Word has length 39 [2019-12-27 01:54:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:01,026 INFO L462 AbstractCegarLoop]: Abstraction has 12271 states and 37679 transitions. [2019-12-27 01:54:01,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:54:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 12271 states and 37679 transitions. [2019-12-27 01:54:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:54:01,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:01,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:54:01,044 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 01:54:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 515851026, now seen corresponding path program 1 times [2019-12-27 01:54:01,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:01,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847131347] [2019-12-27 01:54:01,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:01,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847131347] [2019-12-27 01:54:01,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:01,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:54:01,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931936271] [2019-12-27 01:54:01,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:54:01,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:01,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:54:01,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:54:01,112 INFO L87 Difference]: Start difference. First operand 12271 states and 37679 transitions. Second operand 5 states. [2019-12-27 01:54:01,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:01,186 INFO L93 Difference]: Finished difference Result 11017 states and 34440 transitions. [2019-12-27 01:54:01,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:54:01,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 01:54:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:01,208 INFO L225 Difference]: With dead ends: 11017 [2019-12-27 01:54:01,209 INFO L226 Difference]: Without dead ends: 11017 [2019-12-27 01:54:01,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:54:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2019-12-27 01:54:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 10393. [2019-12-27 01:54:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-27 01:54:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-27 01:54:01,457 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 39 [2019-12-27 01:54:01,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:01,457 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-27 01:54:01,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:54:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-27 01:54:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:54:01,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:01,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] [2019-12-27 01:54:01,479 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 01:54:01,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:01,479 INFO L82 PathProgramCache]: Analyzing trace with hash 165786421, now seen corresponding path program 1 times [2019-12-27 01:54:01,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:01,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892628959] [2019-12-27 01:54:01,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:01,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 01:54:01,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892628959] [2019-12-27 01:54:01,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:01,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:54:01,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888372439] [2019-12-27 01:54:01,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:54:01,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:54:01,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:54:01,547 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 4 states. [2019-12-27 01:54:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:01,633 INFO L93 Difference]: Finished difference Result 18723 states and 58888 transitions. [2019-12-27 01:54:01,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:54:01,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 01:54:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:01,650 INFO L225 Difference]: With dead ends: 18723 [2019-12-27 01:54:01,650 INFO L226 Difference]: Without dead ends: 8627 [2019-12-27 01:54:01,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:54:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2019-12-27 01:54:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 8627. [2019-12-27 01:54:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8627 states. [2019-12-27 01:54:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8627 states to 8627 states and 27021 transitions. [2019-12-27 01:54:01,890 INFO L78 Accepts]: Start accepts. Automaton has 8627 states and 27021 transitions. Word has length 53 [2019-12-27 01:54:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:01,890 INFO L462 AbstractCegarLoop]: Abstraction has 8627 states and 27021 transitions. [2019-12-27 01:54:01,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:54:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 8627 states and 27021 transitions. [2019-12-27 01:54:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:54:01,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:01,903 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] [2019-12-27 01:54:01,903 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 01:54:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1891813083, now seen corresponding path program 2 times [2019-12-27 01:54:01,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:01,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650210331] [2019-12-27 01:54:01,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:02,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650210331] [2019-12-27 01:54:02,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:02,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:54:02,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390005188] [2019-12-27 01:54:02,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:54:02,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:02,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:54:02,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:54:02,012 INFO L87 Difference]: Start difference. First operand 8627 states and 27021 transitions. Second operand 7 states. [2019-12-27 01:54:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:02,369 INFO L93 Difference]: Finished difference Result 24029 states and 75191 transitions. [2019-12-27 01:54:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:54:02,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 01:54:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:02,401 INFO L225 Difference]: With dead ends: 24029 [2019-12-27 01:54:02,402 INFO L226 Difference]: Without dead ends: 18333 [2019-12-27 01:54:02,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:54:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18333 states. [2019-12-27 01:54:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18333 to 10739. [2019-12-27 01:54:02,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10739 states. [2019-12-27 01:54:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10739 states to 10739 states and 33937 transitions. [2019-12-27 01:54:02,627 INFO L78 Accepts]: Start accepts. Automaton has 10739 states and 33937 transitions. Word has length 53 [2019-12-27 01:54:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:02,627 INFO L462 AbstractCegarLoop]: Abstraction has 10739 states and 33937 transitions. [2019-12-27 01:54:02,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:54:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 10739 states and 33937 transitions. [2019-12-27 01:54:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:54:02,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:02,644 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] [2019-12-27 01:54:02,644 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 01:54:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:02,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1878615555, now seen corresponding path program 3 times [2019-12-27 01:54:02,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:02,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847120160] [2019-12-27 01:54:02,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:02,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847120160] [2019-12-27 01:54:02,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:02,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:54:02,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106642220] [2019-12-27 01:54:02,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:54:02,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:02,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:54:02,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:54:02,730 INFO L87 Difference]: Start difference. First operand 10739 states and 33937 transitions. Second operand 7 states. [2019-12-27 01:54:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:03,111 INFO L93 Difference]: Finished difference Result 29619 states and 91701 transitions. [2019-12-27 01:54:03,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:54:03,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 01:54:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:03,152 INFO L225 Difference]: With dead ends: 29619 [2019-12-27 01:54:03,152 INFO L226 Difference]: Without dead ends: 21040 [2019-12-27 01:54:03,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:54:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21040 states. [2019-12-27 01:54:03,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21040 to 13259. [2019-12-27 01:54:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13259 states. [2019-12-27 01:54:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13259 states to 13259 states and 41902 transitions. [2019-12-27 01:54:03,431 INFO L78 Accepts]: Start accepts. Automaton has 13259 states and 41902 transitions. Word has length 53 [2019-12-27 01:54:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:03,432 INFO L462 AbstractCegarLoop]: Abstraction has 13259 states and 41902 transitions. [2019-12-27 01:54:03,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:54:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 13259 states and 41902 transitions. [2019-12-27 01:54:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:54:03,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:03,448 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] [2019-12-27 01:54:03,448 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 01:54:03,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:03,448 INFO L82 PathProgramCache]: Analyzing trace with hash 193726155, now seen corresponding path program 4 times [2019-12-27 01:54:03,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:03,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935973437] [2019-12-27 01:54:03,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:03,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935973437] [2019-12-27 01:54:03,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:03,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:54:03,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320991352] [2019-12-27 01:54:03,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:54:03,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:03,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:54:03,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:03,512 INFO L87 Difference]: Start difference. First operand 13259 states and 41902 transitions. Second operand 3 states. [2019-12-27 01:54:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:03,584 INFO L93 Difference]: Finished difference Result 19683 states and 62661 transitions. [2019-12-27 01:54:03,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:54:03,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 01:54:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:03,595 INFO L225 Difference]: With dead ends: 19683 [2019-12-27 01:54:03,596 INFO L226 Difference]: Without dead ends: 6496 [2019-12-27 01:54:03,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2019-12-27 01:54:03,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6496. [2019-12-27 01:54:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-12-27 01:54:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 20893 transitions. [2019-12-27 01:54:03,695 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 20893 transitions. Word has length 53 [2019-12-27 01:54:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:03,696 INFO L462 AbstractCegarLoop]: Abstraction has 6496 states and 20893 transitions. [2019-12-27 01:54:03,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:54:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 20893 transitions. [2019-12-27 01:54:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:54:03,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:03,703 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] [2019-12-27 01:54:03,703 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 01:54:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash 819014287, now seen corresponding path program 5 times [2019-12-27 01:54:03,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:03,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143366495] [2019-12-27 01:54:03,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:03,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143366495] [2019-12-27 01:54:03,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:03,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:54:03,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654200945] [2019-12-27 01:54:03,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:54:03,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:03,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:54:03,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:54:03,828 INFO L87 Difference]: Start difference. First operand 6496 states and 20893 transitions. Second operand 9 states. [2019-12-27 01:54:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:05,339 INFO L93 Difference]: Finished difference Result 34361 states and 106385 transitions. [2019-12-27 01:54:05,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 01:54:05,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 01:54:05,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:05,379 INFO L225 Difference]: With dead ends: 34361 [2019-12-27 01:54:05,379 INFO L226 Difference]: Without dead ends: 27058 [2019-12-27 01:54:05,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 01:54:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27058 states. [2019-12-27 01:54:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27058 to 8895. [2019-12-27 01:54:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8895 states. [2019-12-27 01:54:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8895 states to 8895 states and 28920 transitions. [2019-12-27 01:54:05,638 INFO L78 Accepts]: Start accepts. Automaton has 8895 states and 28920 transitions. Word has length 53 [2019-12-27 01:54:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:05,638 INFO L462 AbstractCegarLoop]: Abstraction has 8895 states and 28920 transitions. [2019-12-27 01:54:05,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:54:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 8895 states and 28920 transitions. [2019-12-27 01:54:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:54:05,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:05,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:54:05,650 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 01:54:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash 743806145, now seen corresponding path program 6 times [2019-12-27 01:54:05,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:05,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694618154] [2019-12-27 01:54:05,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:05,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694618154] [2019-12-27 01:54:05,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:05,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:54:05,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716746842] [2019-12-27 01:54:05,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:54:05,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:05,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:54:05,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:54:05,763 INFO L87 Difference]: Start difference. First operand 8895 states and 28920 transitions. Second operand 9 states. [2019-12-27 01:54:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:06,976 INFO L93 Difference]: Finished difference Result 25540 states and 79803 transitions. [2019-12-27 01:54:06,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 01:54:06,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 01:54:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:07,014 INFO L225 Difference]: With dead ends: 25540 [2019-12-27 01:54:07,014 INFO L226 Difference]: Without dead ends: 23475 [2019-12-27 01:54:07,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 01:54:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23475 states. [2019-12-27 01:54:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23475 to 8823. [2019-12-27 01:54:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8823 states. [2019-12-27 01:54:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8823 states to 8823 states and 28692 transitions. [2019-12-27 01:54:07,262 INFO L78 Accepts]: Start accepts. Automaton has 8823 states and 28692 transitions. Word has length 53 [2019-12-27 01:54:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:07,263 INFO L462 AbstractCegarLoop]: Abstraction has 8823 states and 28692 transitions. [2019-12-27 01:54:07,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:54:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 8823 states and 28692 transitions. [2019-12-27 01:54:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:54:07,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:07,274 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] [2019-12-27 01:54:07,275 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 01:54:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:07,275 INFO L82 PathProgramCache]: Analyzing trace with hash -249470771, now seen corresponding path program 7 times [2019-12-27 01:54:07,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:07,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97852089] [2019-12-27 01:54:07,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:07,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97852089] [2019-12-27 01:54:07,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:07,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:54:07,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818739079] [2019-12-27 01:54:07,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:54:07,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:07,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:54:07,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:07,375 INFO L87 Difference]: Start difference. First operand 8823 states and 28692 transitions. Second operand 3 states. [2019-12-27 01:54:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:07,410 INFO L93 Difference]: Finished difference Result 8821 states and 28687 transitions. [2019-12-27 01:54:07,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:54:07,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 01:54:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:07,425 INFO L225 Difference]: With dead ends: 8821 [2019-12-27 01:54:07,425 INFO L226 Difference]: Without dead ends: 8821 [2019-12-27 01:54:07,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8821 states. [2019-12-27 01:54:07,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8821 to 8821. [2019-12-27 01:54:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8821 states. [2019-12-27 01:54:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8821 states to 8821 states and 28687 transitions. [2019-12-27 01:54:07,560 INFO L78 Accepts]: Start accepts. Automaton has 8821 states and 28687 transitions. Word has length 53 [2019-12-27 01:54:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:07,560 INFO L462 AbstractCegarLoop]: Abstraction has 8821 states and 28687 transitions. [2019-12-27 01:54:07,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:54:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 8821 states and 28687 transitions. [2019-12-27 01:54:07,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 01:54:07,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:07,573 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] [2019-12-27 01:54:07,573 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 01:54:07,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:07,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1788158321, now seen corresponding path program 1 times [2019-12-27 01:54:07,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:07,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763646997] [2019-12-27 01:54:07,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:07,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763646997] [2019-12-27 01:54:07,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:07,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:54:07,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413219155] [2019-12-27 01:54:07,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:54:07,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:07,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:54:07,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:07,648 INFO L87 Difference]: Start difference. First operand 8821 states and 28687 transitions. Second operand 3 states. [2019-12-27 01:54:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:07,690 INFO L93 Difference]: Finished difference Result 7804 states and 24650 transitions. [2019-12-27 01:54:07,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:54:07,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 01:54:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:07,705 INFO L225 Difference]: With dead ends: 7804 [2019-12-27 01:54:07,705 INFO L226 Difference]: Without dead ends: 7804 [2019-12-27 01:54:07,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7804 states. [2019-12-27 01:54:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7804 to 7628. [2019-12-27 01:54:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7628 states. [2019-12-27 01:54:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7628 states to 7628 states and 24072 transitions. [2019-12-27 01:54:07,821 INFO L78 Accepts]: Start accepts. Automaton has 7628 states and 24072 transitions. Word has length 54 [2019-12-27 01:54:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:07,822 INFO L462 AbstractCegarLoop]: Abstraction has 7628 states and 24072 transitions. [2019-12-27 01:54:07,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:54:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 7628 states and 24072 transitions. [2019-12-27 01:54:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:54:07,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:07,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:54:07,830 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 01:54:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:07,831 INFO L82 PathProgramCache]: Analyzing trace with hash 404282337, now seen corresponding path program 1 times [2019-12-27 01:54:07,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:07,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276173310] [2019-12-27 01:54:07,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:07,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276173310] [2019-12-27 01:54:07,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:07,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:54:07,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062732773] [2019-12-27 01:54:07,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:54:07,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:54:07,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:54:07,950 INFO L87 Difference]: Start difference. First operand 7628 states and 24072 transitions. Second operand 9 states. [2019-12-27 01:54:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:09,035 INFO L93 Difference]: Finished difference Result 13518 states and 42077 transitions. [2019-12-27 01:54:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:54:09,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 01:54:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:09,051 INFO L225 Difference]: With dead ends: 13518 [2019-12-27 01:54:09,051 INFO L226 Difference]: Without dead ends: 9336 [2019-12-27 01:54:09,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:54:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9336 states. [2019-12-27 01:54:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9336 to 7946. [2019-12-27 01:54:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7946 states. [2019-12-27 01:54:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7946 states to 7946 states and 24806 transitions. [2019-12-27 01:54:09,307 INFO L78 Accepts]: Start accepts. Automaton has 7946 states and 24806 transitions. Word has length 55 [2019-12-27 01:54:09,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:09,307 INFO L462 AbstractCegarLoop]: Abstraction has 7946 states and 24806 transitions. [2019-12-27 01:54:09,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:54:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 7946 states and 24806 transitions. [2019-12-27 01:54:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:54:09,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:09,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:54:09,317 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 01:54:09,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash 905870895, now seen corresponding path program 2 times [2019-12-27 01:54:09,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:09,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895492445] [2019-12-27 01:54:09,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:09,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895492445] [2019-12-27 01:54:09,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:09,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 01:54:09,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921258516] [2019-12-27 01:54:09,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 01:54:09,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:09,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 01:54:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:54:09,921 INFO L87 Difference]: Start difference. First operand 7946 states and 24806 transitions. Second operand 18 states. [2019-12-27 01:54:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:14,359 INFO L93 Difference]: Finished difference Result 13530 states and 40502 transitions. [2019-12-27 01:54:14,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 01:54:14,360 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-27 01:54:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:14,375 INFO L225 Difference]: With dead ends: 13530 [2019-12-27 01:54:14,376 INFO L226 Difference]: Without dead ends: 10354 [2019-12-27 01:54:14,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=577, Invalid=3455, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 01:54:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10354 states. [2019-12-27 01:54:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10354 to 8604. [2019-12-27 01:54:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8604 states. [2019-12-27 01:54:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8604 states to 8604 states and 26522 transitions. [2019-12-27 01:54:14,507 INFO L78 Accepts]: Start accepts. Automaton has 8604 states and 26522 transitions. Word has length 55 [2019-12-27 01:54:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:14,508 INFO L462 AbstractCegarLoop]: Abstraction has 8604 states and 26522 transitions. [2019-12-27 01:54:14,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 01:54:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 8604 states and 26522 transitions. [2019-12-27 01:54:14,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:54:14,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:14,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:54:14,516 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 01:54:14,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:14,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1087540505, now seen corresponding path program 3 times [2019-12-27 01:54:14,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:14,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20851993] [2019-12-27 01:54:14,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:14,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20851993] [2019-12-27 01:54:14,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:14,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:54:14,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744404782] [2019-12-27 01:54:14,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:54:14,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:14,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:54:14,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:54:14,698 INFO L87 Difference]: Start difference. First operand 8604 states and 26522 transitions. Second operand 10 states. [2019-12-27 01:54:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:15,241 INFO L93 Difference]: Finished difference Result 10996 states and 33558 transitions. [2019-12-27 01:54:15,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:54:15,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 01:54:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:15,257 INFO L225 Difference]: With dead ends: 10996 [2019-12-27 01:54:15,257 INFO L226 Difference]: Without dead ends: 10686 [2019-12-27 01:54:15,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-27 01:54:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10686 states. [2019-12-27 01:54:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10686 to 9720. [2019-12-27 01:54:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9720 states. [2019-12-27 01:54:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9720 states to 9720 states and 29918 transitions. [2019-12-27 01:54:15,406 INFO L78 Accepts]: Start accepts. Automaton has 9720 states and 29918 transitions. Word has length 55 [2019-12-27 01:54:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:15,407 INFO L462 AbstractCegarLoop]: Abstraction has 9720 states and 29918 transitions. [2019-12-27 01:54:15,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:54:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 9720 states and 29918 transitions. [2019-12-27 01:54:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:54:15,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:15,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:54:15,417 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 01:54:15,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:15,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1093024805, now seen corresponding path program 4 times [2019-12-27 01:54:15,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:15,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835925564] [2019-12-27 01:54:15,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:15,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835925564] [2019-12-27 01:54:15,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:15,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:54:15,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60821010] [2019-12-27 01:54:15,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:54:15,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:15,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:54:15,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:54:15,613 INFO L87 Difference]: Start difference. First operand 9720 states and 29918 transitions. Second operand 10 states. [2019-12-27 01:54:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:16,214 INFO L93 Difference]: Finished difference Result 10910 states and 33104 transitions. [2019-12-27 01:54:16,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:54:16,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 01:54:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:16,229 INFO L225 Difference]: With dead ends: 10910 [2019-12-27 01:54:16,229 INFO L226 Difference]: Without dead ends: 9355 [2019-12-27 01:54:16,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:54:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-27 01:54:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 8285. [2019-12-27 01:54:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8285 states. [2019-12-27 01:54:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8285 states to 8285 states and 25643 transitions. [2019-12-27 01:54:16,353 INFO L78 Accepts]: Start accepts. Automaton has 8285 states and 25643 transitions. Word has length 55 [2019-12-27 01:54:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:16,353 INFO L462 AbstractCegarLoop]: Abstraction has 8285 states and 25643 transitions. [2019-12-27 01:54:16,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:54:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 8285 states and 25643 transitions. [2019-12-27 01:54:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:54:16,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:16,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:54:16,366 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:16,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:16,366 INFO L82 PathProgramCache]: Analyzing trace with hash 408163443, now seen corresponding path program 5 times [2019-12-27 01:54:16,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:16,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889611019] [2019-12-27 01:54:16,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:54:16,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889611019] [2019-12-27 01:54:16,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:16,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:54:16,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797120053] [2019-12-27 01:54:16,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:54:16,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:16,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:54:16,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:54:16,537 INFO L87 Difference]: Start difference. First operand 8285 states and 25643 transitions. Second operand 11 states. [2019-12-27 01:54:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:17,262 INFO L93 Difference]: Finished difference Result 11173 states and 33991 transitions. [2019-12-27 01:54:17,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 01:54:17,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 01:54:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:17,276 INFO L225 Difference]: With dead ends: 11173 [2019-12-27 01:54:17,277 INFO L226 Difference]: Without dead ends: 8617 [2019-12-27 01:54:17,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:54:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8617 states. [2019-12-27 01:54:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8617 to 7783. [2019-12-27 01:54:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7783 states. [2019-12-27 01:54:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7783 states to 7783 states and 24188 transitions. [2019-12-27 01:54:17,405 INFO L78 Accepts]: Start accepts. Automaton has 7783 states and 24188 transitions. Word has length 55 [2019-12-27 01:54:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:17,405 INFO L462 AbstractCegarLoop]: Abstraction has 7783 states and 24188 transitions. [2019-12-27 01:54:17,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:54:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 7783 states and 24188 transitions. [2019-12-27 01:54:17,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:54:17,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:17,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:54:17,414 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:17,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:17,414 INFO L82 PathProgramCache]: Analyzing trace with hash 406067685, now seen corresponding path program 6 times [2019-12-27 01:54:17,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:17,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092635059] [2019-12-27 01:54:17,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:54:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:54:17,530 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:54:17,531 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:54:17,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff0_thd1~0_335 0) (= 0 v_~y$r_buff1_thd3~0_125) (= v_~x~0_35 0) (= v_~y$w_buff1~0_269 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t636~0.base_28|) (= 0 v_~y$r_buff1_thd2~0_133) (= v_~a~0_54 0) (= |v_ULTIMATE.start_main_~#t636~0.offset_19| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t636~0.base_28|) 0) (= v_~y$w_buff1_used~0_559 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t636~0.base_28| 4) |v_#length_21|) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~y$r_buff0_thd2~0_172) (= v_~y$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$w_buff0_used~0_854 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= v_~__unbuffered_p0_EBX~0_53 0) (= v_~z~0_107 0) (= 0 v_~y$r_buff0_thd3~0_136) (= v_~weak$$choice2~0_153 0) (= v_~y$mem_tmp~0_47 0) (= v_~__unbuffered_p2_EBX~0_59 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_cnt~0_162 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t636~0.base_28| 1)) (= 0 v_~y$flush_delayed~0_90) (= 0 |v_#NULL.base_3|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t636~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t636~0.base_28|) |v_ULTIMATE.start_main_~#t636~0.offset_19| 0)) |v_#memory_int_17|) (= v_~y$r_buff0_thd0~0_138 0) (= 0 v_~y$w_buff0~0_440) (= v_~y$r_buff1_thd1~0_236 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_34) (= v_~y$r_buff1_thd0~0_136 0) (= v_~y~0_214 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t638~0.offset=|v_ULTIMATE.start_main_~#t638~0.offset_17|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_54, ~y$mem_tmp~0=v_~y$mem_tmp~0_47, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, ULTIMATE.start_main_~#t638~0.base=|v_ULTIMATE.start_main_~#t638~0.base_23|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_335, ~y$flush_delayed~0=v_~y$flush_delayed~0_90, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_59, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_53, ULTIMATE.start_main_~#t636~0.offset=|v_ULTIMATE.start_main_~#t636~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_269, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_172, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ULTIMATE.start_main_~#t637~0.offset=|v_ULTIMATE.start_main_~#t637~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_162, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~x~0=v_~x~0_35, ULTIMATE.start_main_~#t636~0.base=|v_ULTIMATE.start_main_~#t636~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_854, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_95|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_67|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_440, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ~y~0=v_~y~0_214, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_133, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_138, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_153, ULTIMATE.start_main_~#t637~0.base=|v_ULTIMATE.start_main_~#t637~0.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_~#t638~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t638~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t636~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t637~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t636~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t637~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:54:17,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L831-1-->L833: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t637~0.base_11|) (= |v_ULTIMATE.start_main_~#t637~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t637~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t637~0.base_11|) |v_ULTIMATE.start_main_~#t637~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t637~0.base_11| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t637~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t637~0.base_11| 0)) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t637~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t637~0.offset=|v_ULTIMATE.start_main_~#t637~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t637~0.base=|v_ULTIMATE.start_main_~#t637~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t637~0.offset, #length, ULTIMATE.start_main_~#t637~0.base] because there is no mapped edge [2019-12-27 01:54:17,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t638~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t638~0.base_11|)) (= |v_ULTIMATE.start_main_~#t638~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t638~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t638~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t638~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t638~0.base_11|) |v_ULTIMATE.start_main_~#t638~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t638~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t638~0.base=|v_ULTIMATE.start_main_~#t638~0.base_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t638~0.offset=|v_ULTIMATE.start_main_~#t638~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t638~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t638~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 01:54:17,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] P1ENTRY-->L5-3: Formula: (and (= ~y$w_buff0~0_Out-1739312464 1) (= P1Thread1of1ForFork1_~arg.base_Out-1739312464 |P1Thread1of1ForFork1_#in~arg.base_In-1739312464|) (= 1 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1739312464|) (= ~y$w_buff1~0_Out-1739312464 ~y$w_buff0~0_In-1739312464) (= (mod ~y$w_buff1_used~0_Out-1739312464 256) 0) (= 1 ~y$w_buff0_used~0_Out-1739312464) (= ~y$w_buff0_used~0_In-1739312464 ~y$w_buff1_used~0_Out-1739312464) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1739312464 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1739312464|) (= P1Thread1of1ForFork1_~arg.offset_Out-1739312464 |P1Thread1of1ForFork1_#in~arg.offset_In-1739312464|)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1739312464, ~y$w_buff0~0=~y$w_buff0~0_In-1739312464, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1739312464|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1739312464|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1739312464, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-1739312464, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1739312464, ~y$w_buff1~0=~y$w_buff1~0_Out-1739312464, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1739312464|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-1739312464, ~y$w_buff0~0=~y$w_buff0~0_Out-1739312464, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1739312464|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1739312464|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1739312464} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:54:17,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2032367482 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-2032367482 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite33_Out-2032367482| |P2Thread1of1ForFork2_#t~ite32_Out-2032367482|))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite32_Out-2032367482| ~y~0_In-2032367482) .cse2) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In-2032367482 |P2Thread1of1ForFork2_#t~ite32_Out-2032367482|) .cse2))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2032367482, ~y$w_buff1~0=~y$w_buff1~0_In-2032367482, ~y~0=~y~0_In-2032367482, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2032367482} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2032367482, ~y$w_buff1~0=~y$w_buff1~0_In-2032367482, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out-2032367482|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out-2032367482|, ~y~0=~y~0_In-2032367482, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2032367482} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 01:54:17,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In174163719 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In174163719 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out174163719| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out174163719| ~y$w_buff0_used~0_In174163719)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In174163719, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In174163719} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In174163719, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In174163719, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out174163719|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 01:54:17,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-419259435 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-419259435 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite34_Out-419259435| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite34_Out-419259435| ~y$w_buff0_used~0_In-419259435)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-419259435, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-419259435} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-419259435|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-419259435, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-419259435} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 01:54:17,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1761240255 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1761240255 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1761240255 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1761240255 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1761240255 |P2Thread1of1ForFork2_#t~ite35_Out-1761240255|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite35_Out-1761240255| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1761240255, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1761240255, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1761240255, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1761240255} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-1761240255|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1761240255, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1761240255, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1761240255, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1761240255} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 01:54:17,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In723974721 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In723974721 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite36_Out723974721| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite36_Out723974721| ~y$r_buff0_thd3~0_In723974721)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In723974721, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In723974721} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out723974721|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In723974721, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In723974721} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 01:54:17,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In943298137 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In943298137 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In943298137 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In943298137 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite37_Out943298137|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In943298137 |P2Thread1of1ForFork2_#t~ite37_Out943298137|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In943298137, ~y$w_buff0_used~0=~y$w_buff0_used~0_In943298137, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In943298137, ~y$w_buff1_used~0=~y$w_buff1_used~0_In943298137} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out943298137|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In943298137, ~y$w_buff0_used~0=~y$w_buff0_used~0_In943298137, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In943298137, ~y$w_buff1_used~0=~y$w_buff1_used~0_In943298137} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 01:54:17,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite37_40| v_~y$r_buff1_thd3~0_74) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 01:54:17,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2073672367 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2073672367 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In2073672367 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2073672367 256)))) (or (and (= ~y$w_buff1_used~0_In2073672367 |P1Thread1of1ForFork1_#t~ite29_Out2073672367|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out2073672367|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2073672367, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2073672367, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2073672367, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2073672367} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2073672367, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2073672367|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2073672367, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2073672367, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2073672367} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 01:54:17,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-273900862 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-273900862 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out-273900862) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-273900862 ~y$r_buff0_thd2~0_Out-273900862) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-273900862, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-273900862} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-273900862|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-273900862, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-273900862} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 01:54:17,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1851782980 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1851782980 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1851782980 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1851782980 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out1851782980| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite31_Out1851782980| ~y$r_buff1_thd2~0_In1851782980)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1851782980, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1851782980, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1851782980, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851782980} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1851782980, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1851782980, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1851782980|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1851782980, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851782980} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 01:54:17,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P1Thread1of1ForFork1_#t~ite31_40| v_~y$r_buff1_thd2~0_54) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 01:54:17,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L750-->L750-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-96777852 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite9_Out-96777852| ~y$w_buff0~0_In-96777852) (= |P0Thread1of1ForFork0_#t~ite8_In-96777852| |P0Thread1of1ForFork0_#t~ite8_Out-96777852|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-96777852 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-96777852 256)) (and (= (mod ~y$w_buff1_used~0_In-96777852 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-96777852 256))))) (= |P0Thread1of1ForFork0_#t~ite9_Out-96777852| |P0Thread1of1ForFork0_#t~ite8_Out-96777852|) .cse0 (= |P0Thread1of1ForFork0_#t~ite8_Out-96777852| ~y$w_buff0~0_In-96777852)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-96777852, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-96777852, ~y$w_buff0~0=~y$w_buff0~0_In-96777852, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-96777852, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In-96777852|, ~weak$$choice2~0=~weak$$choice2~0_In-96777852, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96777852} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-96777852, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out-96777852|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-96777852, ~y$w_buff0~0=~y$w_buff0~0_In-96777852, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-96777852|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-96777852, ~weak$$choice2~0=~weak$$choice2~0_In-96777852, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96777852} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 01:54:17,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L751-->L751-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1064621132 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite12_Out1064621132| |P0Thread1of1ForFork0_#t~ite11_Out1064621132|) (= ~y$w_buff1~0_In1064621132 |P0Thread1of1ForFork0_#t~ite11_Out1064621132|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1064621132 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1064621132 256)) (and .cse0 (= (mod ~y$w_buff1_used~0_In1064621132 256) 0)) (and (= 0 (mod ~y$r_buff1_thd1~0_In1064621132 256)) .cse0))) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite11_In1064621132| |P0Thread1of1ForFork0_#t~ite11_Out1064621132|) (= |P0Thread1of1ForFork0_#t~ite12_Out1064621132| ~y$w_buff1~0_In1064621132)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In1064621132|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1064621132, ~y$w_buff1~0=~y$w_buff1~0_In1064621132, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1064621132, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1064621132, ~weak$$choice2~0=~weak$$choice2~0_In1064621132, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1064621132} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out1064621132|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1064621132, ~y$w_buff1~0=~y$w_buff1~0_In1064621132, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1064621132, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1064621132, ~weak$$choice2~0=~weak$$choice2~0_In1064621132, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out1064621132|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1064621132} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 01:54:17,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L754-->L755-8: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite22_35| |v_P0Thread1of1ForFork0_#t~ite22_34|) (= |v_P0Thread1of1ForFork0_#t~ite23_31| |v_P0Thread1of1ForFork0_#t~ite23_30|) (= v_~y$r_buff1_thd1~0_224 |v_P0Thread1of1ForFork0_#t~ite24_32|) (= v_~y$r_buff0_thd1~0_326 v_~y$r_buff0_thd1~0_325) (not (= 0 (mod v_~weak$$choice2~0_143 256)))) InVars {P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_326, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_31|} OutVars{P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_37|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_48|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_33|, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite24=|v_P0Thread1of1ForFork0_#t~ite24_32|, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_30|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 01:54:17,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (not (= (mod v_~y$flush_delayed~0_17 256) 0)) (= v_~y~0_46 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_16) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 01:54:17,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_42) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:54:17,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-2108602721 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2108602721 256) 0))) (or (and (= ~y~0_In-2108602721 |ULTIMATE.start_main_#t~ite41_Out-2108602721|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out-2108602721| ~y$w_buff1~0_In-2108602721) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2108602721, ~y~0=~y~0_In-2108602721, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2108602721, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2108602721} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2108602721|, ~y$w_buff1~0=~y$w_buff1~0_In-2108602721, ~y~0=~y~0_In-2108602721, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2108602721, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2108602721} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 01:54:17,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 01:54:17,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-649108869 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-649108869 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-649108869| ~y$w_buff0_used~0_In-649108869)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-649108869| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-649108869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-649108869} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-649108869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-649108869, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-649108869|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 01:54:17,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1561252612 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1561252612 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1561252612 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1561252612 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out1561252612| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out1561252612| ~y$w_buff1_used~0_In1561252612) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1561252612, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1561252612, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1561252612, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1561252612} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1561252612, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1561252612, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1561252612, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1561252612|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1561252612} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 01:54:17,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2004020363 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2004020363 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-2004020363|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-2004020363 |ULTIMATE.start_main_#t~ite45_Out-2004020363|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004020363, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2004020363} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004020363, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2004020363, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2004020363|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 01:54:17,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1174321323 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1174321323 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1174321323 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1174321323 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out1174321323| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1174321323 |ULTIMATE.start_main_#t~ite46_Out1174321323|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1174321323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1174321323, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1174321323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1174321323} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1174321323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1174321323, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1174321323|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1174321323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1174321323} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 01:54:17,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= v_~z~0_50 2) (= 1 v_~__unbuffered_p0_EAX~0_34) (= v_~__unbuffered_p0_EBX~0_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 2 v_~__unbuffered_p2_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite46_39| v_~y$r_buff1_thd0~0_74) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_74, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:54:17,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:54:17 BasicIcfg [2019-12-27 01:54:17,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:54:17,702 INFO L168 Benchmark]: Toolchain (without parser) took 55733.84 ms. Allocated memory was 138.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 102.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 749.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:54:17,703 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 01:54:17,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.46 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 156.5 MB in the end (delta: -54.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-27 01:54:17,704 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.01 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:54:17,704 INFO L168 Benchmark]: Boogie Preprocessor took 41.28 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:54:17,704 INFO L168 Benchmark]: RCFGBuilder took 800.29 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 104.3 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:54:17,710 INFO L168 Benchmark]: TraceAbstraction took 54059.42 ms. Allocated memory was 202.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 104.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 687.4 MB. Max. memory is 7.1 GB. [2019-12-27 01:54:17,712 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.49 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.46 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 156.5 MB in the end (delta: -54.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.01 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.28 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 800.29 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 104.3 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54059.42 ms. Allocated memory was 202.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 104.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 687.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 6616 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 74173 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 53.6s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4277 SDtfs, 7132 SDslu, 14654 SDs, 0 SdLazy, 7903 SolverSat, 374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 37 SyntacticMatches, 12 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2208 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 101878 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 961 NumberOfCodeBlocks, 961 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 883 ConstructedInterpolants, 0 QuantifiedInterpolants, 186147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...