/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:36:13,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:36:13,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:36:13,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:36:13,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:36:13,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:36:13,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:36:13,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:36:13,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:36:13,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:36:13,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:36:13,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:36:13,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:36:13,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:36:13,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:36:13,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:36:13,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:36:13,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:36:13,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:36:13,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:36:13,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:36:13,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:36:13,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:36:13,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:36:13,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:36:13,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:36:13,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:36:13,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:36:13,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:36:13,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:36:13,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:36:13,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:36:13,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:36:13,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:36:13,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:36:13,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:36:13,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:36:13,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:36:13,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:36:13,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:36:13,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:36:13,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:36:13,711 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:36:13,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:36:13,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:36:13,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:36:13,713 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:36:13,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:36:13,713 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:36:13,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:36:13,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:36:13,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:36:13,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:36:13,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:36:13,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:36:13,714 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:36:13,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:36:13,715 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:36:13,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:36:13,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:36:13,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:36:13,715 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:36:13,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:36:13,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:36:13,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:36:13,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:36:13,716 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:36:13,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:36:13,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:36:13,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:36:13,717 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:36:13,717 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:36:14,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:36:14,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:36:14,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:36:14,027 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:36:14,027 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:36:14,028 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_power.opt.i [2019-12-26 22:36:14,088 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87df317c6/962768f229ff41c6adbb6f17b1efc74b/FLAGcbf67cb67 [2019-12-26 22:36:14,616 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:36:14,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_power.opt.i [2019-12-26 22:36:14,635 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87df317c6/962768f229ff41c6adbb6f17b1efc74b/FLAGcbf67cb67 [2019-12-26 22:36:14,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87df317c6/962768f229ff41c6adbb6f17b1efc74b [2019-12-26 22:36:14,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:36:14,944 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:36:14,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:36:14,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:36:14,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:36:14,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:36:14" (1/1) ... [2019-12-26 22:36:14,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d874f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:14, skipping insertion in model container [2019-12-26 22:36:14,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:36:14" (1/1) ... [2019-12-26 22:36:14,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:36:15,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:36:15,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:36:15,607 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:36:15,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:36:15,851 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:36:15,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:15 WrapperNode [2019-12-26 22:36:15,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:36:15,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:36:15,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:36:15,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:36:15,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:15" (1/1) ... [2019-12-26 22:36:15,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:15" (1/1) ... [2019-12-26 22:36:15,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:36:15,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:36:15,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:36:15,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:36:15,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:15" (1/1) ... [2019-12-26 22:36:15,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:15" (1/1) ... [2019-12-26 22:36:16,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:15" (1/1) ... [2019-12-26 22:36:16,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:15" (1/1) ... [2019-12-26 22:36:16,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:15" (1/1) ... [2019-12-26 22:36:16,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:15" (1/1) ... [2019-12-26 22:36:16,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:15" (1/1) ... [2019-12-26 22:36:16,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:36:16,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:36:16,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:36:16,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:36:16,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:36:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:36:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:36:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:36:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:36:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:36:16,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:36:16,132 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:36:16,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:36:16,132 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:36:16,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:36:16,133 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:36:16,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:36:16,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:36:16,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:36:16,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:36:16,135 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:36:16,879 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:36:16,879 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:36:16,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:36:16 BoogieIcfgContainer [2019-12-26 22:36:16,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:36:16,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:36:16,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:36:16,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:36:16,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:36:14" (1/3) ... [2019-12-26 22:36:16,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f071328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:36:16, skipping insertion in model container [2019-12-26 22:36:16,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:15" (2/3) ... [2019-12-26 22:36:16,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f071328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:36:16, skipping insertion in model container [2019-12-26 22:36:16,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:36:16" (3/3) ... [2019-12-26 22:36:16,890 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_power.opt.i [2019-12-26 22:36:16,898 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:36:16,898 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:36:16,905 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:36:16,906 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:36:16,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,946 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,947 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,948 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,948 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,949 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,950 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,975 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,975 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,975 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,975 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,976 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,976 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,976 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,988 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,989 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,992 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,992 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,995 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,996 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,997 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:16,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:17,011 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:36:17,030 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:36:17,030 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:36:17,030 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:36:17,030 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:36:17,030 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:36:17,031 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:36:17,031 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:36:17,031 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:36:17,049 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-26 22:36:17,051 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-26 22:36:17,183 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-26 22:36:17,183 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:36:17,199 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:36:17,215 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-26 22:36:17,309 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-26 22:36:17,310 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:36:17,319 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:36:17,339 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 22:36:17,340 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:36:17,586 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-12-26 22:36:23,049 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-26 22:36:23,213 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-26 22:36:23,238 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-26 22:36:23,239 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-26 22:36:23,243 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-26 22:36:25,840 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-26 22:36:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-26 22:36:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:36:25,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:25,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:25,851 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:36:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:25,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-26 22:36:25,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:25,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918432517] [2019-12-26 22:36:25,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:26,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918432517] [2019-12-26 22:36:26,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:26,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:36:26,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49939943] [2019-12-26 22:36:26,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:26,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:26,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:26,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:26,140 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-26 22:36:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:26,897 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-26 22:36:26,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:26,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:36:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:27,185 INFO L225 Difference]: With dead ends: 33638 [2019-12-26 22:36:27,185 INFO L226 Difference]: Without dead ends: 32966 [2019-12-26 22:36:27,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-26 22:36:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-26 22:36:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-26 22:36:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-26 22:36:28,942 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-26 22:36:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:28,944 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-26 22:36:28,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-26 22:36:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:36:28,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:28,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:28,951 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:36:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-26 22:36:28,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:28,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598484599] [2019-12-26 22:36:28,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:30,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598484599] [2019-12-26 22:36:30,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:30,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:30,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968701558] [2019-12-26 22:36:30,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:30,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:30,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:30,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:30,323 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-26 22:36:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:31,006 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-26 22:36:31,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:31,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:36:31,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:31,233 INFO L225 Difference]: With dead ends: 44494 [2019-12-26 22:36:31,233 INFO L226 Difference]: Without dead ends: 44494 [2019-12-26 22:36:31,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-26 22:36:33,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-26 22:36:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-26 22:36:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-26 22:36:33,533 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-26 22:36:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:33,533 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-26 22:36:33,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-26 22:36:33,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:36:33,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:33,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:33,537 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:36:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:33,538 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-26 22:36:33,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:33,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252079434] [2019-12-26 22:36:33,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:33,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252079434] [2019-12-26 22:36:33,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:33,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:33,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859920906] [2019-12-26 22:36:33,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:33,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:33,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:33,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:33,677 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-26 22:36:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:36,221 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-26 22:36:36,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:36,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:36:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:36,509 INFO L225 Difference]: With dead ends: 62082 [2019-12-26 22:36:36,509 INFO L226 Difference]: Without dead ends: 62054 [2019-12-26 22:36:36,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-26 22:36:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-26 22:36:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-26 22:36:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-26 22:36:38,589 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-26 22:36:38,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:38,589 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-26 22:36:38,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-26 22:36:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 22:36:38,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:38,606 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] [2019-12-26 22:36:38,606 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:36:38,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:38,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-26 22:36:38,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:38,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747386732] [2019-12-26 22:36:38,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:38,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747386732] [2019-12-26 22:36:38,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:38,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:38,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140555962] [2019-12-26 22:36:38,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:36:38,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:38,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:36:38,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:38,699 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-26 22:36:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:39,446 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-26 22:36:39,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:36:39,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-26 22:36:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:39,654 INFO L225 Difference]: With dead ends: 68854 [2019-12-26 22:36:39,654 INFO L226 Difference]: Without dead ends: 68826 [2019-12-26 22:36:39,654 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-26 22:36:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-26 22:36:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-26 22:36:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-26 22:36:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-26 22:36:43,769 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-26 22:36:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:43,769 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-26 22:36:43,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:36:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-26 22:36:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:36:43,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:43,828 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] [2019-12-26 22:36:43,828 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:36:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-26 22:36:43,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:43,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348093741] [2019-12-26 22:36:43,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:43,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348093741] [2019-12-26 22:36:43,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:43,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:43,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881883709] [2019-12-26 22:36:43,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:43,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:43,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:43,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:43,933 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-26 22:36:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:44,287 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-26 22:36:44,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:44,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-26 22:36:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:44,446 INFO L225 Difference]: With dead ends: 64130 [2019-12-26 22:36:44,446 INFO L226 Difference]: Without dead ends: 64130 [2019-12-26 22:36:44,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-26 22:36:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-26 22:36:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-26 22:36:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-26 22:36:48,181 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-26 22:36:48,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:48,181 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-26 22:36:48,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-26 22:36:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:36:48,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:48,217 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] [2019-12-26 22:36:48,217 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:36:48,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:48,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-26 22:36:48,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:48,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296926047] [2019-12-26 22:36:48,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:48,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296926047] [2019-12-26 22:36:48,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:48,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:36:48,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157064034] [2019-12-26 22:36:48,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:36:48,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:36:48,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:36:48,318 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 6 states. [2019-12-26 22:36:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:49,509 INFO L93 Difference]: Finished difference Result 81602 states and 332376 transitions. [2019-12-26 22:36:49,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:36:49,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 22:36:49,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:49,704 INFO L225 Difference]: With dead ends: 81602 [2019-12-26 22:36:49,704 INFO L226 Difference]: Without dead ends: 81538 [2019-12-26 22:36:49,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:36:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81538 states. [2019-12-26 22:36:53,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81538 to 65578. [2019-12-26 22:36:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-26 22:36:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 270440 transitions. [2019-12-26 22:36:53,941 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 270440 transitions. Word has length 29 [2019-12-26 22:36:53,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:53,941 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 270440 transitions. [2019-12-26 22:36:53,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:36:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 270440 transitions. [2019-12-26 22:36:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-26 22:36:54,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:54,012 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] [2019-12-26 22:36:54,012 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:36:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:54,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1048930675, now seen corresponding path program 1 times [2019-12-26 22:36:54,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:54,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529803850] [2019-12-26 22:36:54,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:54,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529803850] [2019-12-26 22:36:54,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:54,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:54,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489476578] [2019-12-26 22:36:54,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:54,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:54,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:54,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:54,117 INFO L87 Difference]: Start difference. First operand 65578 states and 270440 transitions. Second operand 3 states. [2019-12-26 22:36:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:55,084 INFO L93 Difference]: Finished difference Result 65578 states and 269720 transitions. [2019-12-26 22:36:55,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:55,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-26 22:36:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:55,269 INFO L225 Difference]: With dead ends: 65578 [2019-12-26 22:36:55,269 INFO L226 Difference]: Without dead ends: 65578 [2019-12-26 22:36:55,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65578 states. [2019-12-26 22:37:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65578 to 65578. [2019-12-26 22:37:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-26 22:37:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 269720 transitions. [2019-12-26 22:37:00,224 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 269720 transitions. Word has length 35 [2019-12-26 22:37:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:00,225 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 269720 transitions. [2019-12-26 22:37:00,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:37:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 269720 transitions. [2019-12-26 22:37:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-26 22:37:00,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:00,282 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] [2019-12-26 22:37:00,283 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:00,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:00,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1735231015, now seen corresponding path program 1 times [2019-12-26 22:37:00,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:00,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519400301] [2019-12-26 22:37:00,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:00,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519400301] [2019-12-26 22:37:00,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:00,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:37:00,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209216177] [2019-12-26 22:37:00,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:37:00,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:00,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:37:00,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:00,460 INFO L87 Difference]: Start difference. First operand 65578 states and 269720 transitions. Second operand 9 states. [2019-12-26 22:37:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:02,129 INFO L93 Difference]: Finished difference Result 89414 states and 361616 transitions. [2019-12-26 22:37:02,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 22:37:02,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-26 22:37:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:02,376 INFO L225 Difference]: With dead ends: 89414 [2019-12-26 22:37:02,376 INFO L226 Difference]: Without dead ends: 89310 [2019-12-26 22:37:02,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:37:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89310 states. [2019-12-26 22:37:04,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89310 to 58886. [2019-12-26 22:37:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58886 states. [2019-12-26 22:37:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58886 states to 58886 states and 243296 transitions. [2019-12-26 22:37:04,373 INFO L78 Accepts]: Start accepts. Automaton has 58886 states and 243296 transitions. Word has length 35 [2019-12-26 22:37:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:04,373 INFO L462 AbstractCegarLoop]: Abstraction has 58886 states and 243296 transitions. [2019-12-26 22:37:04,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:37:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 58886 states and 243296 transitions. [2019-12-26 22:37:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-26 22:37:04,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:04,441 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] [2019-12-26 22:37:04,441 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:04,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:04,442 INFO L82 PathProgramCache]: Analyzing trace with hash 903389864, now seen corresponding path program 1 times [2019-12-26 22:37:04,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:04,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631493235] [2019-12-26 22:37:04,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:04,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631493235] [2019-12-26 22:37:04,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:04,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:37:04,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359593138] [2019-12-26 22:37:04,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:37:04,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:04,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:37:04,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:37:04,552 INFO L87 Difference]: Start difference. First operand 58886 states and 243296 transitions. Second operand 6 states. [2019-12-26 22:37:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:05,739 INFO L93 Difference]: Finished difference Result 74494 states and 310372 transitions. [2019-12-26 22:37:05,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:37:05,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-26 22:37:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:05,919 INFO L225 Difference]: With dead ends: 74494 [2019-12-26 22:37:05,920 INFO L226 Difference]: Without dead ends: 71114 [2019-12-26 22:37:05,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:37:06,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71114 states. [2019-12-26 22:37:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71114 to 65978. [2019-12-26 22:37:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65978 states. [2019-12-26 22:37:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65978 states to 65978 states and 274224 transitions. [2019-12-26 22:37:11,218 INFO L78 Accepts]: Start accepts. Automaton has 65978 states and 274224 transitions. Word has length 35 [2019-12-26 22:37:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:11,218 INFO L462 AbstractCegarLoop]: Abstraction has 65978 states and 274224 transitions. [2019-12-26 22:37:11,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:37:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 65978 states and 274224 transitions. [2019-12-26 22:37:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 22:37:11,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:11,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:11,286 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:11,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817762, now seen corresponding path program 1 times [2019-12-26 22:37:11,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:11,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150607542] [2019-12-26 22:37:11,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:11,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150607542] [2019-12-26 22:37:11,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:11,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:37:11,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465870792] [2019-12-26 22:37:11,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:37:11,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:11,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:37:11,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:37:11,370 INFO L87 Difference]: Start difference. First operand 65978 states and 274224 transitions. Second operand 4 states. [2019-12-26 22:37:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:11,616 INFO L93 Difference]: Finished difference Result 52787 states and 201884 transitions. [2019-12-26 22:37:11,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:37:11,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-26 22:37:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:11,732 INFO L225 Difference]: With dead ends: 52787 [2019-12-26 22:37:11,732 INFO L226 Difference]: Without dead ends: 51679 [2019-12-26 22:37:11,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:37:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51679 states. [2019-12-26 22:37:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51679 to 51679. [2019-12-26 22:37:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51679 states. [2019-12-26 22:37:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51679 states to 51679 states and 198408 transitions. [2019-12-26 22:37:13,346 INFO L78 Accepts]: Start accepts. Automaton has 51679 states and 198408 transitions. Word has length 37 [2019-12-26 22:37:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:13,346 INFO L462 AbstractCegarLoop]: Abstraction has 51679 states and 198408 transitions. [2019-12-26 22:37:13,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:37:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 51679 states and 198408 transitions. [2019-12-26 22:37:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-26 22:37:13,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:13,392 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] [2019-12-26 22:37:13,393 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:13,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:13,393 INFO L82 PathProgramCache]: Analyzing trace with hash 859028932, now seen corresponding path program 1 times [2019-12-26 22:37:13,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:13,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744202617] [2019-12-26 22:37:13,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:13,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744202617] [2019-12-26 22:37:13,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:13,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:37:13,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360420223] [2019-12-26 22:37:13,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:37:13,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:13,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:37:13,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:37:13,591 INFO L87 Difference]: Start difference. First operand 51679 states and 198408 transitions. Second operand 10 states. [2019-12-26 22:37:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:14,832 INFO L93 Difference]: Finished difference Result 94848 states and 364721 transitions. [2019-12-26 22:37:14,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:37:14,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-26 22:37:14,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:15,015 INFO L225 Difference]: With dead ends: 94848 [2019-12-26 22:37:15,016 INFO L226 Difference]: Without dead ends: 80903 [2019-12-26 22:37:15,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:37:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80903 states. [2019-12-26 22:37:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80903 to 71623. [2019-12-26 22:37:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71623 states. [2019-12-26 22:37:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71623 states to 71623 states and 276265 transitions. [2019-12-26 22:37:17,182 INFO L78 Accepts]: Start accepts. Automaton has 71623 states and 276265 transitions. Word has length 38 [2019-12-26 22:37:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:17,183 INFO L462 AbstractCegarLoop]: Abstraction has 71623 states and 276265 transitions. [2019-12-26 22:37:17,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:37:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 71623 states and 276265 transitions. [2019-12-26 22:37:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:37:17,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:17,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:17,262 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:17,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:17,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1056030818, now seen corresponding path program 1 times [2019-12-26 22:37:17,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:17,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012906798] [2019-12-26 22:37:17,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:17,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012906798] [2019-12-26 22:37:17,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:17,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:37:17,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492209120] [2019-12-26 22:37:17,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:37:17,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:17,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:37:17,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:37:17,492 INFO L87 Difference]: Start difference. First operand 71623 states and 276265 transitions. Second operand 11 states. [2019-12-26 22:37:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:18,857 INFO L93 Difference]: Finished difference Result 113904 states and 437171 transitions. [2019-12-26 22:37:18,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:37:18,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-12-26 22:37:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:19,095 INFO L225 Difference]: With dead ends: 113904 [2019-12-26 22:37:19,095 INFO L226 Difference]: Without dead ends: 98880 [2019-12-26 22:37:19,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:37:20,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98880 states. [2019-12-26 22:37:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98880 to 68121. [2019-12-26 22:37:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68121 states. [2019-12-26 22:37:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68121 states to 68121 states and 260194 transitions. [2019-12-26 22:37:21,523 INFO L78 Accepts]: Start accepts. Automaton has 68121 states and 260194 transitions. Word has length 39 [2019-12-26 22:37:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:21,524 INFO L462 AbstractCegarLoop]: Abstraction has 68121 states and 260194 transitions. [2019-12-26 22:37:21,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:37:21,524 INFO L276 IsEmpty]: Start isEmpty. Operand 68121 states and 260194 transitions. [2019-12-26 22:37:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:37:21,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:21,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:21,596 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:21,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:21,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1970391329, now seen corresponding path program 1 times [2019-12-26 22:37:21,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:21,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801238674] [2019-12-26 22:37:21,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:21,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801238674] [2019-12-26 22:37:21,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:21,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:37:21,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795343637] [2019-12-26 22:37:21,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:37:21,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:37:21,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:21,714 INFO L87 Difference]: Start difference. First operand 68121 states and 260194 transitions. Second operand 7 states. [2019-12-26 22:37:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:22,982 INFO L93 Difference]: Finished difference Result 110913 states and 417742 transitions. [2019-12-26 22:37:22,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:37:22,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-26 22:37:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:23,158 INFO L225 Difference]: With dead ends: 110913 [2019-12-26 22:37:23,159 INFO L226 Difference]: Without dead ends: 66518 [2019-12-26 22:37:23,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:37:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66518 states. [2019-12-26 22:37:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66518 to 57403. [2019-12-26 22:37:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57403 states. [2019-12-26 22:37:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57403 states to 57403 states and 216601 transitions. [2019-12-26 22:37:24,354 INFO L78 Accepts]: Start accepts. Automaton has 57403 states and 216601 transitions. Word has length 39 [2019-12-26 22:37:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:24,354 INFO L462 AbstractCegarLoop]: Abstraction has 57403 states and 216601 transitions. [2019-12-26 22:37:24,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:37:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 57403 states and 216601 transitions. [2019-12-26 22:37:24,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:37:24,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:24,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:24,411 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:24,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:24,411 INFO L82 PathProgramCache]: Analyzing trace with hash 134445563, now seen corresponding path program 2 times [2019-12-26 22:37:24,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:24,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244992491] [2019-12-26 22:37:24,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:24,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-26 22:37:24,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244992491] [2019-12-26 22:37:24,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:24,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:37:24,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014557282] [2019-12-26 22:37:24,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:37:24,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:24,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:37:24,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:24,649 INFO L87 Difference]: Start difference. First operand 57403 states and 216601 transitions. Second operand 9 states. [2019-12-26 22:37:25,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:25,915 INFO L93 Difference]: Finished difference Result 79221 states and 293406 transitions. [2019-12-26 22:37:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:37:25,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-12-26 22:37:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:26,084 INFO L225 Difference]: With dead ends: 79221 [2019-12-26 22:37:26,084 INFO L226 Difference]: Without dead ends: 78813 [2019-12-26 22:37:26,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:37:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78813 states. [2019-12-26 22:37:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78813 to 68873. [2019-12-26 22:37:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68873 states. [2019-12-26 22:37:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68873 states to 68873 states and 257262 transitions. [2019-12-26 22:37:27,535 INFO L78 Accepts]: Start accepts. Automaton has 68873 states and 257262 transitions. Word has length 39 [2019-12-26 22:37:27,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:27,536 INFO L462 AbstractCegarLoop]: Abstraction has 68873 states and 257262 transitions. [2019-12-26 22:37:27,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:37:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 68873 states and 257262 transitions. [2019-12-26 22:37:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:37:27,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:27,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:27,615 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:27,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:27,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1106388304, now seen corresponding path program 1 times [2019-12-26 22:37:27,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:27,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478133661] [2019-12-26 22:37:27,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:27,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478133661] [2019-12-26 22:37:27,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:27,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:37:27,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145617844] [2019-12-26 22:37:27,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:37:27,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:27,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:37:27,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:37:27,805 INFO L87 Difference]: Start difference. First operand 68873 states and 257262 transitions. Second operand 6 states. [2019-12-26 22:37:28,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:28,726 INFO L93 Difference]: Finished difference Result 64448 states and 236599 transitions. [2019-12-26 22:37:28,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:37:28,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-26 22:37:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:28,863 INFO L225 Difference]: With dead ends: 64448 [2019-12-26 22:37:28,863 INFO L226 Difference]: Without dead ends: 61460 [2019-12-26 22:37:28,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:37:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61460 states. [2019-12-26 22:37:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61460 to 46453. [2019-12-26 22:37:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46453 states. [2019-12-26 22:37:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46453 states to 46453 states and 171982 transitions. [2019-12-26 22:37:29,802 INFO L78 Accepts]: Start accepts. Automaton has 46453 states and 171982 transitions. Word has length 39 [2019-12-26 22:37:29,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:29,802 INFO L462 AbstractCegarLoop]: Abstraction has 46453 states and 171982 transitions. [2019-12-26 22:37:29,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:37:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 46453 states and 171982 transitions. [2019-12-26 22:37:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:37:29,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:29,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:29,848 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:29,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:29,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1511864111, now seen corresponding path program 1 times [2019-12-26 22:37:29,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:29,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978583431] [2019-12-26 22:37:29,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:29,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978583431] [2019-12-26 22:37:29,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:29,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:37:29,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574273005] [2019-12-26 22:37:29,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:37:29,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:29,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:37:29,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:37:29,970 INFO L87 Difference]: Start difference. First operand 46453 states and 171982 transitions. Second operand 8 states. [2019-12-26 22:37:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:30,435 INFO L93 Difference]: Finished difference Result 72493 states and 264537 transitions. [2019-12-26 22:37:30,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:37:30,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-26 22:37:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:30,566 INFO L225 Difference]: With dead ends: 72493 [2019-12-26 22:37:30,567 INFO L226 Difference]: Without dead ends: 63023 [2019-12-26 22:37:30,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:37:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63023 states. [2019-12-26 22:37:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63023 to 45646. [2019-12-26 22:37:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45646 states. [2019-12-26 22:37:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45646 states to 45646 states and 168479 transitions. [2019-12-26 22:37:32,085 INFO L78 Accepts]: Start accepts. Automaton has 45646 states and 168479 transitions. Word has length 39 [2019-12-26 22:37:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:32,085 INFO L462 AbstractCegarLoop]: Abstraction has 45646 states and 168479 transitions. [2019-12-26 22:37:32,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:37:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 45646 states and 168479 transitions. [2019-12-26 22:37:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:37:32,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:32,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:32,129 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:32,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:32,130 INFO L82 PathProgramCache]: Analyzing trace with hash 71622762, now seen corresponding path program 1 times [2019-12-26 22:37:32,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:32,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437979108] [2019-12-26 22:37:32,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:32,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437979108] [2019-12-26 22:37:32,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:32,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:37:32,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835416055] [2019-12-26 22:37:32,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:37:32,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:32,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:37:32,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:37:32,230 INFO L87 Difference]: Start difference. First operand 45646 states and 168479 transitions. Second operand 5 states. [2019-12-26 22:37:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:32,349 INFO L93 Difference]: Finished difference Result 15925 states and 49582 transitions. [2019-12-26 22:37:32,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:37:32,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:37:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:32,396 INFO L225 Difference]: With dead ends: 15925 [2019-12-26 22:37:32,397 INFO L226 Difference]: Without dead ends: 15071 [2019-12-26 22:37:32,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15071 states. [2019-12-26 22:37:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15071 to 15071. [2019-12-26 22:37:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15071 states. [2019-12-26 22:37:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15071 states to 15071 states and 46853 transitions. [2019-12-26 22:37:32,746 INFO L78 Accepts]: Start accepts. Automaton has 15071 states and 46853 transitions. Word has length 40 [2019-12-26 22:37:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:32,746 INFO L462 AbstractCegarLoop]: Abstraction has 15071 states and 46853 transitions. [2019-12-26 22:37:32,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:37:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 15071 states and 46853 transitions. [2019-12-26 22:37:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 22:37:32,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:32,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:32,756 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:32,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:32,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1368489979, now seen corresponding path program 1 times [2019-12-26 22:37:32,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:32,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532773274] [2019-12-26 22:37:32,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:32,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532773274] [2019-12-26 22:37:32,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:32,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:37:32,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981979231] [2019-12-26 22:37:32,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:37:32,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:32,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:37:32,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:37:32,833 INFO L87 Difference]: Start difference. First operand 15071 states and 46853 transitions. Second operand 6 states. [2019-12-26 22:37:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:32,909 INFO L93 Difference]: Finished difference Result 3176 states and 7971 transitions. [2019-12-26 22:37:32,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:37:32,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 22:37:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:32,915 INFO L225 Difference]: With dead ends: 3176 [2019-12-26 22:37:32,915 INFO L226 Difference]: Without dead ends: 2829 [2019-12-26 22:37:32,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2019-12-26 22:37:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2765. [2019-12-26 22:37:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2765 states. [2019-12-26 22:37:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 6785 transitions. [2019-12-26 22:37:32,976 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 6785 transitions. Word has length 41 [2019-12-26 22:37:32,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:32,976 INFO L462 AbstractCegarLoop]: Abstraction has 2765 states and 6785 transitions. [2019-12-26 22:37:32,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:37:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 6785 transitions. [2019-12-26 22:37:32,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-26 22:37:32,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:32,982 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] [2019-12-26 22:37:32,982 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:32,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:32,982 INFO L82 PathProgramCache]: Analyzing trace with hash -784185183, now seen corresponding path program 1 times [2019-12-26 22:37:32,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:32,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697577911] [2019-12-26 22:37:32,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:33,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697577911] [2019-12-26 22:37:33,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:33,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:37:33,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169784405] [2019-12-26 22:37:33,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:37:33,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:33,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:37:33,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:33,112 INFO L87 Difference]: Start difference. First operand 2765 states and 6785 transitions. Second operand 7 states. [2019-12-26 22:37:33,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:33,238 INFO L93 Difference]: Finished difference Result 1208 states and 3304 transitions. [2019-12-26 22:37:33,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:37:33,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-26 22:37:33,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:33,240 INFO L225 Difference]: With dead ends: 1208 [2019-12-26 22:37:33,241 INFO L226 Difference]: Without dead ends: 1162 [2019-12-26 22:37:33,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:37:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-12-26 22:37:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1050. [2019-12-26 22:37:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-12-26 22:37:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2894 transitions. [2019-12-26 22:37:33,262 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2894 transitions. Word has length 48 [2019-12-26 22:37:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:33,262 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 2894 transitions. [2019-12-26 22:37:33,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:37:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2894 transitions. [2019-12-26 22:37:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:37:33,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:33,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:33,266 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:33,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:33,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1193491105, now seen corresponding path program 1 times [2019-12-26 22:37:33,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:33,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950631397] [2019-12-26 22:37:33,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:33,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950631397] [2019-12-26 22:37:33,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:33,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:37:33,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097209369] [2019-12-26 22:37:33,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:37:33,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:33,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:37:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:37:33,612 INFO L87 Difference]: Start difference. First operand 1050 states and 2894 transitions. Second operand 13 states. [2019-12-26 22:37:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:34,425 INFO L93 Difference]: Finished difference Result 2025 states and 5456 transitions. [2019-12-26 22:37:34,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 22:37:34,426 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-26 22:37:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:34,429 INFO L225 Difference]: With dead ends: 2025 [2019-12-26 22:37:34,429 INFO L226 Difference]: Without dead ends: 1631 [2019-12-26 22:37:34,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-12-26 22:37:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-12-26 22:37:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1094. [2019-12-26 22:37:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-12-26 22:37:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 3016 transitions. [2019-12-26 22:37:34,452 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 3016 transitions. Word has length 59 [2019-12-26 22:37:34,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:34,452 INFO L462 AbstractCegarLoop]: Abstraction has 1094 states and 3016 transitions. [2019-12-26 22:37:34,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:37:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 3016 transitions. [2019-12-26 22:37:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:37:34,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:34,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:34,455 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:34,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:34,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2035601323, now seen corresponding path program 2 times [2019-12-26 22:37:34,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:34,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375951780] [2019-12-26 22:37:34,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:34,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375951780] [2019-12-26 22:37:34,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:34,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:37:34,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040834953] [2019-12-26 22:37:34,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:37:34,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:34,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:37:34,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:37:34,736 INFO L87 Difference]: Start difference. First operand 1094 states and 3016 transitions. Second operand 13 states. [2019-12-26 22:37:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:35,769 INFO L93 Difference]: Finished difference Result 2492 states and 6601 transitions. [2019-12-26 22:37:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 22:37:35,770 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-26 22:37:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:35,774 INFO L225 Difference]: With dead ends: 2492 [2019-12-26 22:37:35,774 INFO L226 Difference]: Without dead ends: 2026 [2019-12-26 22:37:35,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2019-12-26 22:37:35,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-12-26 22:37:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1172. [2019-12-26 22:37:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-12-26 22:37:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 3199 transitions. [2019-12-26 22:37:35,793 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 3199 transitions. Word has length 59 [2019-12-26 22:37:35,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:35,793 INFO L462 AbstractCegarLoop]: Abstraction has 1172 states and 3199 transitions. [2019-12-26 22:37:35,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:37:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 3199 transitions. [2019-12-26 22:37:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:37:35,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:35,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:35,796 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:35,796 INFO L82 PathProgramCache]: Analyzing trace with hash 391383943, now seen corresponding path program 3 times [2019-12-26 22:37:35,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:35,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593410077] [2019-12-26 22:37:35,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:35,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593410077] [2019-12-26 22:37:35,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:35,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:37:35,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799553713] [2019-12-26 22:37:35,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:37:35,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:35,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:37:35,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:35,870 INFO L87 Difference]: Start difference. First operand 1172 states and 3199 transitions. Second operand 3 states. [2019-12-26 22:37:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:35,889 INFO L93 Difference]: Finished difference Result 1100 states and 2943 transitions. [2019-12-26 22:37:35,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:37:35,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:37:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:35,892 INFO L225 Difference]: With dead ends: 1100 [2019-12-26 22:37:35,892 INFO L226 Difference]: Without dead ends: 1100 [2019-12-26 22:37:35,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:35,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2019-12-26 22:37:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1080. [2019-12-26 22:37:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-12-26 22:37:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 2895 transitions. [2019-12-26 22:37:36,023 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 2895 transitions. Word has length 59 [2019-12-26 22:37:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:36,023 INFO L462 AbstractCegarLoop]: Abstraction has 1080 states and 2895 transitions. [2019-12-26 22:37:36,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:37:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 2895 transitions. [2019-12-26 22:37:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:37:36,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:36,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:36,026 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:36,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:36,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1518280330, now seen corresponding path program 1 times [2019-12-26 22:37:36,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:36,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805940932] [2019-12-26 22:37:36,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:36,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805940932] [2019-12-26 22:37:36,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:36,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:37:36,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872794394] [2019-12-26 22:37:36,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 22:37:36,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:36,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 22:37:36,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:37:36,442 INFO L87 Difference]: Start difference. First operand 1080 states and 2895 transitions. Second operand 14 states. [2019-12-26 22:37:36,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:36,947 INFO L93 Difference]: Finished difference Result 1649 states and 4431 transitions. [2019-12-26 22:37:36,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 22:37:36,948 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-26 22:37:36,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:36,950 INFO L225 Difference]: With dead ends: 1649 [2019-12-26 22:37:36,951 INFO L226 Difference]: Without dead ends: 1086 [2019-12-26 22:37:36,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:37:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-12-26 22:37:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 972. [2019-12-26 22:37:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-12-26 22:37:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 2611 transitions. [2019-12-26 22:37:36,963 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 2611 transitions. Word has length 60 [2019-12-26 22:37:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:36,963 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 2611 transitions. [2019-12-26 22:37:36,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 22:37:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 2611 transitions. [2019-12-26 22:37:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:37:36,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:36,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:36,965 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:36,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:36,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1121095450, now seen corresponding path program 2 times [2019-12-26 22:37:36,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:36,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960221495] [2019-12-26 22:37:36,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:37,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960221495] [2019-12-26 22:37:37,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:37,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:37:37,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574145169] [2019-12-26 22:37:37,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:37:37,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:37,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:37:37,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:37:37,216 INFO L87 Difference]: Start difference. First operand 972 states and 2611 transitions. Second operand 13 states. [2019-12-26 22:37:38,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:38,056 INFO L93 Difference]: Finished difference Result 1901 states and 4797 transitions. [2019-12-26 22:37:38,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 22:37:38,057 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-26 22:37:38,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:38,059 INFO L225 Difference]: With dead ends: 1901 [2019-12-26 22:37:38,059 INFO L226 Difference]: Without dead ends: 1286 [2019-12-26 22:37:38,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2019-12-26 22:37:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2019-12-26 22:37:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1018. [2019-12-26 22:37:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-12-26 22:37:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2722 transitions. [2019-12-26 22:37:38,074 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2722 transitions. Word has length 60 [2019-12-26 22:37:38,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:38,074 INFO L462 AbstractCegarLoop]: Abstraction has 1018 states and 2722 transitions. [2019-12-26 22:37:38,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:37:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2722 transitions. [2019-12-26 22:37:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:37:38,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:38,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:38,076 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash 523594792, now seen corresponding path program 3 times [2019-12-26 22:37:38,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:38,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274875347] [2019-12-26 22:37:38,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:38,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274875347] [2019-12-26 22:37:38,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:38,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:37:38,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34526440] [2019-12-26 22:37:38,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:37:38,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:38,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:37:38,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:38,199 INFO L87 Difference]: Start difference. First operand 1018 states and 2722 transitions. Second operand 7 states. [2019-12-26 22:37:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:38,313 INFO L93 Difference]: Finished difference Result 1560 states and 3932 transitions. [2019-12-26 22:37:38,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:37:38,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-26 22:37:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:38,314 INFO L225 Difference]: With dead ends: 1560 [2019-12-26 22:37:38,315 INFO L226 Difference]: Without dead ends: 552 [2019-12-26 22:37:38,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:37:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-12-26 22:37:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 532. [2019-12-26 22:37:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-26 22:37:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1146 transitions. [2019-12-26 22:37:38,322 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1146 transitions. Word has length 60 [2019-12-26 22:37:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:38,322 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 1146 transitions. [2019-12-26 22:37:38,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:37:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1146 transitions. [2019-12-26 22:37:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:37:38,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:38,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:38,323 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:38,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:38,323 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 4 times [2019-12-26 22:37:38,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:38,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200250805] [2019-12-26 22:37:38,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:37:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:37:38,432 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:37:38,432 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:37:38,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1133~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1133~0.base_21|) |v_ULTIMATE.start_main_~#t1133~0.offset_16| 0)) |v_#memory_int_27|) (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= (select .cse0 |v_ULTIMATE.start_main_~#t1133~0.base_21|) 0) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_ULTIMATE.start_main_~#t1133~0.offset_16| 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (= v_~z$r_buff0_thd2~0_135 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1133~0.base_21| 4)) (= 0 v_~z$r_buff1_thd3~0_221) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (< 0 |v_#StackHeapBarrier_20|) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1133~0.base_21| 1)) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1133~0.base_21|) (= 0 v_~z$r_buff1_thd4~0_193) (= v_~z$w_buff0~0_113 0) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, ULTIMATE.start_main_~#t1134~0.offset=|v_ULTIMATE.start_main_~#t1134~0.offset_16|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ULTIMATE.start_main_~#t1136~0.base=|v_ULTIMATE.start_main_~#t1136~0.base_22|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ULTIMATE.start_main_~#t1133~0.base=|v_ULTIMATE.start_main_~#t1133~0.base_21|, ULTIMATE.start_main_~#t1134~0.base=|v_ULTIMATE.start_main_~#t1134~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_~#t1136~0.offset=|v_ULTIMATE.start_main_~#t1136~0.offset_16|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ULTIMATE.start_main_~#t1135~0.offset=|v_ULTIMATE.start_main_~#t1135~0.offset_16|, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ULTIMATE.start_main_~#t1135~0.base=|v_ULTIMATE.start_main_~#t1135~0.base_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ULTIMATE.start_main_~#t1133~0.offset=|v_ULTIMATE.start_main_~#t1133~0.offset_16|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1134~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1136~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1133~0.base, ULTIMATE.start_main_~#t1134~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1136~0.offset, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1135~0.offset, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ULTIMATE.start_main_~#t1135~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1133~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:37:38,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1134~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1134~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1134~0.base_12| 4)) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1134~0.base_12| 1) |v_#valid_44|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1134~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1134~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1134~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1134~0.base_12|) |v_ULTIMATE.start_main_~#t1134~0.offset_10| 1)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1134~0.base=|v_ULTIMATE.start_main_~#t1134~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t1134~0.offset=|v_ULTIMATE.start_main_~#t1134~0.offset_10|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1134~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1134~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-26 22:37:38,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1135~0.base_8|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1135~0.base_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1135~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1135~0.base_8|) |v_ULTIMATE.start_main_~#t1135~0.offset_8| 2)) |v_#memory_int_17|) (= 0 |v_ULTIMATE.start_main_~#t1135~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1135~0.base_8| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1135~0.base_8| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1135~0.base_8|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ULTIMATE.start_main_~#t1135~0.base=|v_ULTIMATE.start_main_~#t1135~0.base_8|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1135~0.offset=|v_ULTIMATE.start_main_~#t1135~0.offset_8|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1135~0.base, #length, ULTIMATE.start_main_~#t1135~0.offset] because there is no mapped edge [2019-12-26 22:37:38,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (= |v_ULTIMATE.start_main_~#t1136~0.offset_10| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1136~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1136~0.base_12|) |v_ULTIMATE.start_main_~#t1136~0.offset_10| 3)) |v_#memory_int_23|) (not (= 0 |v_ULTIMATE.start_main_~#t1136~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1136~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1136~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1136~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1136~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1136~0.base=|v_ULTIMATE.start_main_~#t1136~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ULTIMATE.start_main_~#t1136~0.offset=|v_ULTIMATE.start_main_~#t1136~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1136~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1136~0.offset] because there is no mapped edge [2019-12-26 22:37:38,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= ~z$r_buff1_thd1~0_Out363799147 ~z$r_buff0_thd1~0_In363799147) (= ~z$r_buff0_thd4~0_In363799147 ~z$r_buff1_thd4~0_Out363799147) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In363799147 0)) (= ~z$r_buff1_thd2~0_Out363799147 ~z$r_buff0_thd2~0_In363799147) (= ~__unbuffered_p3_EAX~0_Out363799147 ~a~0_Out363799147) (= ~z$r_buff0_thd3~0_In363799147 ~z$r_buff1_thd3~0_Out363799147) (= ~__unbuffered_p3_EBX~0_Out363799147 ~b~0_In363799147) (= ~a~0_Out363799147 1) (= 1 ~z$r_buff0_thd4~0_Out363799147) (= ~z$r_buff1_thd0~0_Out363799147 ~z$r_buff0_thd0~0_In363799147)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In363799147, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In363799147, ~b~0=~b~0_In363799147, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In363799147, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In363799147, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In363799147, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In363799147} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In363799147, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out363799147, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out363799147, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out363799147, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out363799147, ~a~0=~a~0_Out363799147, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In363799147, ~b~0=~b~0_In363799147, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out363799147, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out363799147, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out363799147, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out363799147, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In363799147, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In363799147, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In363799147} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-26 22:37:38,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:37:38,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_~x~0_18 1) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:37:38,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-160993078 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-160993078 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-160993078|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-160993078 |P3Thread1of1ForFork3_#t~ite11_Out-160993078|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-160993078, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-160993078} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-160993078, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-160993078, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-160993078|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-26 22:37:38,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1763841982 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1763841982 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In1763841982 |P2Thread1of1ForFork2_#t~ite3_Out1763841982|) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In1763841982 |P2Thread1of1ForFork2_#t~ite3_Out1763841982|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1763841982, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1763841982, ~z$w_buff1~0=~z$w_buff1~0_In1763841982, ~z~0=~z~0_In1763841982} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1763841982|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1763841982, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1763841982, ~z$w_buff1~0=~z$w_buff1~0_In1763841982, ~z~0=~z~0_In1763841982} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:37:38,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_9|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-26 22:37:38,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1098303888 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1098303888 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1098303888|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1098303888 |P2Thread1of1ForFork2_#t~ite5_Out-1098303888|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1098303888, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1098303888} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1098303888|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1098303888, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1098303888} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:37:38,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-705520090 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-705520090 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-705520090 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-705520090 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-705520090|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-705520090 |P2Thread1of1ForFork2_#t~ite6_Out-705520090|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-705520090, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-705520090, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-705520090, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-705520090} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-705520090|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-705520090, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-705520090, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-705520090, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-705520090} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:37:38,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1369046027 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1369046027 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out1369046027|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out1369046027| ~z$r_buff0_thd3~0_In1369046027)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1369046027, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1369046027} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1369046027, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1369046027, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1369046027|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:37:38,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In2071946042 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In2071946042 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In2071946042 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In2071946042 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out2071946042| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In2071946042 |P2Thread1of1ForFork2_#t~ite8_Out2071946042|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2071946042, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2071946042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2071946042, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2071946042} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2071946042, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2071946042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2071946042, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2071946042, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out2071946042|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:37:38,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:37:38,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-348913170 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-348913170 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-348913170 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-348913170 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out-348913170| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-348913170 |P3Thread1of1ForFork3_#t~ite12_Out-348913170|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-348913170, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-348913170, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-348913170, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-348913170} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-348913170, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-348913170, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-348913170, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-348913170, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-348913170|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-26 22:37:38,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1671047399 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1671047399 256) 0))) (or (and (= ~z$r_buff0_thd4~0_In-1671047399 ~z$r_buff0_thd4~0_Out-1671047399) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-1671047399) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1671047399, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1671047399} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1671047399, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1671047399, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1671047399|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-26 22:37:38,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In-1722241570 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1722241570 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1722241570 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1722241570 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-1722241570|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd4~0_In-1722241570 |P3Thread1of1ForFork3_#t~ite14_Out-1722241570|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1722241570, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1722241570, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1722241570, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1722241570} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1722241570, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1722241570, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1722241570|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1722241570, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1722241570} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-26 22:37:38,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_48| v_~z$r_buff1_thd4~0_102)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_47|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 22:37:38,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 22:37:38,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite20_Out205718108| |ULTIMATE.start_main_#t~ite19_Out205718108|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In205718108 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In205718108 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In205718108 |ULTIMATE.start_main_#t~ite19_Out205718108|)) (and .cse0 (not .cse2) (= ~z$w_buff1~0_In205718108 |ULTIMATE.start_main_#t~ite19_Out205718108|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In205718108, ~z$w_buff1_used~0=~z$w_buff1_used~0_In205718108, ~z$w_buff1~0=~z$w_buff1~0_In205718108, ~z~0=~z~0_In205718108} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out205718108|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In205718108, ~z$w_buff1_used~0=~z$w_buff1_used~0_In205718108, ~z$w_buff1~0=~z$w_buff1~0_In205718108, ~z~0=~z~0_In205718108, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out205718108|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:37:38,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1987357838 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1987357838 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out1987357838|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out1987357838| ~z$w_buff0_used~0_In1987357838) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1987357838, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1987357838} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1987357838, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1987357838, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1987357838|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:37:38,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-619318209 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-619318209 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-619318209 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-619318209 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-619318209| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out-619318209| ~z$w_buff1_used~0_In-619318209)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-619318209, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-619318209, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-619318209, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-619318209} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-619318209, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-619318209, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-619318209, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-619318209, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-619318209|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:37:38,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-699576358 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-699576358 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-699576358|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-699576358 |ULTIMATE.start_main_#t~ite23_Out-699576358|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-699576358, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-699576358} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-699576358, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-699576358, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-699576358|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:37:38,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-1065480023 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1065480023 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1065480023 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1065480023 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-1065480023|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In-1065480023 |ULTIMATE.start_main_#t~ite24_Out-1065480023|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1065480023, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065480023, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1065480023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1065480023} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1065480023, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065480023, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1065480023, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1065480023|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1065480023} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 22:37:38,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-192830254 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-192830254| ~z$w_buff0_used~0_In-192830254) (= |ULTIMATE.start_main_#t~ite36_In-192830254| |ULTIMATE.start_main_#t~ite36_Out-192830254|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite36_Out-192830254| ~z$w_buff0_used~0_In-192830254) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-192830254 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-192830254 256)) (and (= (mod ~z$r_buff1_thd0~0_In-192830254 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-192830254 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite36_Out-192830254| |ULTIMATE.start_main_#t~ite37_Out-192830254|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-192830254, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-192830254, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-192830254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-192830254, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-192830254|, ~weak$$choice2~0=~weak$$choice2~0_In-192830254} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-192830254, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-192830254, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-192830254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-192830254, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-192830254|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-192830254|, ~weak$$choice2~0=~weak$$choice2~0_In-192830254} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-26 22:37:38,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-192463694 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_In-192463694| |ULTIMATE.start_main_#t~ite39_Out-192463694|) (= ~z$w_buff1_used~0_In-192463694 |ULTIMATE.start_main_#t~ite40_Out-192463694|) (not .cse0)) (and .cse0 (= |ULTIMATE.start_main_#t~ite39_Out-192463694| ~z$w_buff1_used~0_In-192463694) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-192463694 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-192463694 256) 0)) (and (= (mod ~z$r_buff1_thd0~0_In-192463694 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-192463694 256) 0))) (= |ULTIMATE.start_main_#t~ite39_Out-192463694| |ULTIMATE.start_main_#t~ite40_Out-192463694|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-192463694, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-192463694, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-192463694|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-192463694, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-192463694, ~weak$$choice2~0=~weak$$choice2~0_In-192463694} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-192463694, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-192463694|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-192463694|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-192463694, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-192463694, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-192463694, ~weak$$choice2~0=~weak$$choice2~0_In-192463694} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:37:38,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:37:38,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:37:38,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:37:38,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:37:38 BasicIcfg [2019-12-26 22:37:38,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:37:38,571 INFO L168 Benchmark]: Toolchain (without parser) took 83627.92 ms. Allocated memory was 139.5 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 101.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-26 22:37:38,571 INFO L168 Benchmark]: CDTParser took 1.49 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 22:37:38,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 907.76 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 156.5 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:38,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.55 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:38,573 INFO L168 Benchmark]: Boogie Preprocessor took 78.83 ms. Allocated memory is still 203.4 MB. Free memory was 153.1 MB in the beginning and 151.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:38,573 INFO L168 Benchmark]: RCFGBuilder took 822.09 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 101.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:38,574 INFO L168 Benchmark]: TraceAbstraction took 81687.19 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-26 22:37:38,583 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 907.76 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 156.5 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 123.55 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.83 ms. Allocated memory is still 203.4 MB. Free memory was 153.1 MB in the beginning and 151.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.09 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 101.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 81687.19 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 81.4s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3605 SDtfs, 5912 SDslu, 11639 SDs, 0 SdLazy, 6044 SolverSat, 415 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 28 SyntacticMatches, 20 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71623occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 180635 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1039 NumberOfCodeBlocks, 1039 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 954 ConstructedInterpolants, 0 QuantifiedInterpolants, 279485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...