/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:27:36,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:27:36,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:27:36,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:27:36,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:27:36,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:27:36,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:27:36,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:27:36,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:27:36,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:27:36,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:27:36,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:27:36,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:27:36,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:27:36,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:27:36,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:27:36,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:27:36,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:27:36,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:27:36,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:27:36,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:27:36,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:27:36,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:27:36,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:27:36,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:27:36,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:27:36,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:27:36,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:27:36,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:27:36,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:27:36,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:27:36,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:27:36,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:27:36,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:27:36,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:27:36,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:27:36,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:27:36,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:27:36,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:27:36,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:27:36,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:27:36,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:27:36,663 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:27:36,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:27:36,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:27:36,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:27:36,665 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:27:36,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:27:36,666 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:27:36,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:27:36,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:27:36,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:27:36,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:27:36,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:27:36,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:27:36,667 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:27:36,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:27:36,668 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:27:36,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:27:36,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:27:36,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:27:36,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:27:36,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:27:36,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:27:36,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:27:36,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:27:36,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:27:36,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:27:36,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:27:36,670 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:27:36,670 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:27:36,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:27:36,671 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:27:36,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:27:36,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:27:36,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:27:36,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:27:36,971 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:27:36,972 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:27:36,973 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i [2019-12-27 20:27:37,041 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5369a2bd/247790be66f74cdda3559a91642b8bb3/FLAG1e0f3885b [2019-12-27 20:27:37,609 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:27:37,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i [2019-12-27 20:27:37,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5369a2bd/247790be66f74cdda3559a91642b8bb3/FLAG1e0f3885b [2019-12-27 20:27:37,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5369a2bd/247790be66f74cdda3559a91642b8bb3 [2019-12-27 20:27:37,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:27:37,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:27:37,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:27:37,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:27:37,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:27:37,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:27:37" (1/1) ... [2019-12-27 20:27:37,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad31de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:37, skipping insertion in model container [2019-12-27 20:27:37,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:27:37" (1/1) ... [2019-12-27 20:27:37,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:27:37,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:27:38,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:27:38,529 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:27:38,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:27:38,680 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:27:38,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:38 WrapperNode [2019-12-27 20:27:38,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:27:38,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:27:38,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:27:38,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:27:38,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:38" (1/1) ... [2019-12-27 20:27:38,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:38" (1/1) ... [2019-12-27 20:27:38,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:27:38,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:27:38,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:27:38,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:27:38,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:38" (1/1) ... [2019-12-27 20:27:38,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:38" (1/1) ... [2019-12-27 20:27:38,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:38" (1/1) ... [2019-12-27 20:27:38,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:38" (1/1) ... [2019-12-27 20:27:38,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:38" (1/1) ... [2019-12-27 20:27:38,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:38" (1/1) ... [2019-12-27 20:27:38,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:38" (1/1) ... [2019-12-27 20:27:38,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:27:38,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:27:38,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:27:38,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:27:38,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:27:38,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:27:38,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:27:38,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:27:38,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:27:38,892 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:27:38,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:27:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:27:38,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:27:38,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:27:38,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:27:38,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:27:38,897 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:27:39,843 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:27:39,843 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:27:39,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:27:39 BoogieIcfgContainer [2019-12-27 20:27:39,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:27:39,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:27:39,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:27:39,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:27:39,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:27:37" (1/3) ... [2019-12-27 20:27:39,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5502c0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:27:39, skipping insertion in model container [2019-12-27 20:27:39,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:38" (2/3) ... [2019-12-27 20:27:39,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5502c0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:27:39, skipping insertion in model container [2019-12-27 20:27:39,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:27:39" (3/3) ... [2019-12-27 20:27:39,853 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_tso.oepc.i [2019-12-27 20:27:39,863 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:27:39,863 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:27:39,870 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:27:39,871 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:27:39,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,969 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,970 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,974 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,975 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,978 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:39,996 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:27:40,018 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:27:40,018 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:27:40,019 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:27:40,019 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:27:40,019 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:27:40,019 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:27:40,019 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:27:40,019 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:27:40,042 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-27 20:27:40,044 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-27 20:27:40,186 INFO L132 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-27 20:27:40,187 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:27:40,208 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 20:27:40,237 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-27 20:27:40,305 INFO L132 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-27 20:27:40,305 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:27:40,320 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 20:27:40,353 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-27 20:27:40,354 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:27:43,910 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 20:27:44,069 INFO L206 etLargeBlockEncoding]: Checked pairs total: 164896 [2019-12-27 20:27:44,069 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 20:27:44,073 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 139 transitions [2019-12-27 20:27:45,680 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 28693 states. [2019-12-27 20:27:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 28693 states. [2019-12-27 20:27:45,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:27:45,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:45,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:27:45,689 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:45,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:45,694 INFO L82 PathProgramCache]: Analyzing trace with hash 976559034, now seen corresponding path program 1 times [2019-12-27 20:27:45,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:45,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236417448] [2019-12-27 20:27:45,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:27:45,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236417448] [2019-12-27 20:27:45,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:45,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:27:45,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682604917] [2019-12-27 20:27:45,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:45,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:45,947 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:27:45,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:45,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:45,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:45,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:45,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:45,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:45,971 INFO L87 Difference]: Start difference. First operand 28693 states. Second operand 3 states. [2019-12-27 20:27:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:47,043 INFO L93 Difference]: Finished difference Result 28603 states and 100987 transitions. [2019-12-27 20:27:47,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:47,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:27:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:47,330 INFO L225 Difference]: With dead ends: 28603 [2019-12-27 20:27:47,330 INFO L226 Difference]: Without dead ends: 28044 [2019-12-27 20:27:47,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28044 states. [2019-12-27 20:27:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28044 to 28044. [2019-12-27 20:27:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28044 states. [2019-12-27 20:27:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28044 states to 28044 states and 99141 transitions. [2019-12-27 20:27:49,127 INFO L78 Accepts]: Start accepts. Automaton has 28044 states and 99141 transitions. Word has length 5 [2019-12-27 20:27:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:49,128 INFO L462 AbstractCegarLoop]: Abstraction has 28044 states and 99141 transitions. [2019-12-27 20:27:49,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:49,128 INFO L276 IsEmpty]: Start isEmpty. Operand 28044 states and 99141 transitions. [2019-12-27 20:27:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:27:49,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:49,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:49,136 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:49,136 INFO L82 PathProgramCache]: Analyzing trace with hash 727953079, now seen corresponding path program 1 times [2019-12-27 20:27:49,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:49,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25985313] [2019-12-27 20:27:49,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:27:49,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25985313] [2019-12-27 20:27:49,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:49,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:49,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497346134] [2019-12-27 20:27:49,332 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:49,335 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:49,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 20:27:49,347 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:49,349 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:49,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:49,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:49,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:49,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:49,352 INFO L87 Difference]: Start difference. First operand 28044 states and 99141 transitions. Second operand 4 states. [2019-12-27 20:27:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:50,246 INFO L93 Difference]: Finished difference Result 45067 states and 151887 transitions. [2019-12-27 20:27:50,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:50,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:27:50,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:50,430 INFO L225 Difference]: With dead ends: 45067 [2019-12-27 20:27:50,430 INFO L226 Difference]: Without dead ends: 45060 [2019-12-27 20:27:50,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:27:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45060 states. [2019-12-27 20:27:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45060 to 43678. [2019-12-27 20:27:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43678 states. [2019-12-27 20:27:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43678 states to 43678 states and 148274 transitions. [2019-12-27 20:27:53,512 INFO L78 Accepts]: Start accepts. Automaton has 43678 states and 148274 transitions. Word has length 11 [2019-12-27 20:27:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:53,512 INFO L462 AbstractCegarLoop]: Abstraction has 43678 states and 148274 transitions. [2019-12-27 20:27:53,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 43678 states and 148274 transitions. [2019-12-27 20:27:53,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:27:53,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:53,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:53,519 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:53,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:53,519 INFO L82 PathProgramCache]: Analyzing trace with hash -569945878, now seen corresponding path program 1 times [2019-12-27 20:27:53,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:53,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630514844] [2019-12-27 20:27:53,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:27:53,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630514844] [2019-12-27 20:27:53,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:53,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:53,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1228463160] [2019-12-27 20:27:53,589 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:53,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:53,591 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:27:53,591 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:53,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:53,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:53,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:53,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:53,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:53,593 INFO L87 Difference]: Start difference. First operand 43678 states and 148274 transitions. Second operand 4 states. [2019-12-27 20:27:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:54,437 INFO L93 Difference]: Finished difference Result 54479 states and 183229 transitions. [2019-12-27 20:27:54,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:54,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:27:54,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:54,774 INFO L225 Difference]: With dead ends: 54479 [2019-12-27 20:27:54,774 INFO L226 Difference]: Without dead ends: 54479 [2019-12-27 20:27:54,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:27:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54479 states. [2019-12-27 20:27:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54479 to 49001. [2019-12-27 20:27:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49001 states. [2019-12-27 20:27:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49001 states to 49001 states and 166041 transitions. [2019-12-27 20:27:58,201 INFO L78 Accepts]: Start accepts. Automaton has 49001 states and 166041 transitions. Word has length 11 [2019-12-27 20:27:58,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:58,202 INFO L462 AbstractCegarLoop]: Abstraction has 49001 states and 166041 transitions. [2019-12-27 20:27:58,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 49001 states and 166041 transitions. [2019-12-27 20:27:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 20:27:58,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:58,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:58,206 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1242100263, now seen corresponding path program 1 times [2019-12-27 20:27:58,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:58,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181924224] [2019-12-27 20:27:58,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:27:58,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181924224] [2019-12-27 20:27:58,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:58,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:27:58,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2716578] [2019-12-27 20:27:58,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:58,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:58,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 53 transitions. [2019-12-27 20:27:58,279 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:58,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:58,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:27:58,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:58,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:27:58,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:27:58,281 INFO L87 Difference]: Start difference. First operand 49001 states and 166041 transitions. Second operand 5 states. [2019-12-27 20:27:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:59,225 INFO L93 Difference]: Finished difference Result 64731 states and 215221 transitions. [2019-12-27 20:27:59,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:27:59,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 20:27:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:59,394 INFO L225 Difference]: With dead ends: 64731 [2019-12-27 20:27:59,395 INFO L226 Difference]: Without dead ends: 64724 [2019-12-27 20:27:59,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:28:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64724 states. [2019-12-27 20:28:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64724 to 48844. [2019-12-27 20:28:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48844 states. [2019-12-27 20:28:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48844 states to 48844 states and 165414 transitions. [2019-12-27 20:28:02,660 INFO L78 Accepts]: Start accepts. Automaton has 48844 states and 165414 transitions. Word has length 17 [2019-12-27 20:28:02,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:28:02,660 INFO L462 AbstractCegarLoop]: Abstraction has 48844 states and 165414 transitions. [2019-12-27 20:28:02,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:28:02,660 INFO L276 IsEmpty]: Start isEmpty. Operand 48844 states and 165414 transitions. [2019-12-27 20:28:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:28:02,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:28:02,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:28:02,685 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:28:02,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:28:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1855796261, now seen corresponding path program 1 times [2019-12-27 20:28:02,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:28:02,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008478131] [2019-12-27 20:28:02,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:28:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:28:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:28:02,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008478131] [2019-12-27 20:28:02,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:28:02,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:28:02,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [108213961] [2019-12-27 20:28:02,771 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:28:02,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:28:02,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:28:02,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:28:02,781 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:28:02,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:28:02,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:28:02,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:28:02,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:28:02,782 INFO L87 Difference]: Start difference. First operand 48844 states and 165414 transitions. Second operand 4 states. [2019-12-27 20:28:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:28:02,829 INFO L93 Difference]: Finished difference Result 5701 states and 14235 transitions. [2019-12-27 20:28:02,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:28:02,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 20:28:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:28:02,836 INFO L225 Difference]: With dead ends: 5701 [2019-12-27 20:28:02,836 INFO L226 Difference]: Without dead ends: 4806 [2019-12-27 20:28:02,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:28:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2019-12-27 20:28:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4806. [2019-12-27 20:28:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4806 states. [2019-12-27 20:28:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 11494 transitions. [2019-12-27 20:28:02,894 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 11494 transitions. Word has length 25 [2019-12-27 20:28:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:28:02,895 INFO L462 AbstractCegarLoop]: Abstraction has 4806 states and 11494 transitions. [2019-12-27 20:28:02,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:28:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 11494 transitions. [2019-12-27 20:28:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 20:28:02,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:28:02,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:28:02,900 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:28:02,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:28:02,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1777657148, now seen corresponding path program 1 times [2019-12-27 20:28:02,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:28:02,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502455882] [2019-12-27 20:28:02,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:28:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:28:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:28:03,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502455882] [2019-12-27 20:28:03,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:28:03,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:28:03,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [403529057] [2019-12-27 20:28:03,023 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:28:03,032 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:28:03,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 85 transitions. [2019-12-27 20:28:03,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:28:03,100 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:28:03,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:28:03,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:28:03,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:28:03,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:28:03,102 INFO L87 Difference]: Start difference. First operand 4806 states and 11494 transitions. Second operand 6 states. [2019-12-27 20:28:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:28:03,153 INFO L93 Difference]: Finished difference Result 1096 states and 2313 transitions. [2019-12-27 20:28:03,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:28:03,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 20:28:03,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:28:03,155 INFO L225 Difference]: With dead ends: 1096 [2019-12-27 20:28:03,155 INFO L226 Difference]: Without dead ends: 992 [2019-12-27 20:28:03,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:28:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-12-27 20:28:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 950. [2019-12-27 20:28:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-27 20:28:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2011 transitions. [2019-12-27 20:28:03,165 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2011 transitions. Word has length 37 [2019-12-27 20:28:03,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:28:03,165 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 2011 transitions. [2019-12-27 20:28:03,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:28:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2011 transitions. [2019-12-27 20:28:03,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 20:28:03,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:28:03,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:28:03,168 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:28:03,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:28:03,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1536404517, now seen corresponding path program 1 times [2019-12-27 20:28:03,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:28:03,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114710562] [2019-12-27 20:28:03,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:28:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:28:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:28:03,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114710562] [2019-12-27 20:28:03,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:28:03,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:28:03,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832595757] [2019-12-27 20:28:03,344 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:28:03,372 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:28:03,457 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 184 transitions. [2019-12-27 20:28:03,458 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:28:03,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:28:03,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:28:03,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:28:03,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:28:03,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:28:03,501 INFO L87 Difference]: Start difference. First operand 950 states and 2011 transitions. Second operand 6 states. [2019-12-27 20:28:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:28:04,199 INFO L93 Difference]: Finished difference Result 1406 states and 2952 transitions. [2019-12-27 20:28:04,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 20:28:04,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 20:28:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:28:04,202 INFO L225 Difference]: With dead ends: 1406 [2019-12-27 20:28:04,202 INFO L226 Difference]: Without dead ends: 1406 [2019-12-27 20:28:04,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:28:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2019-12-27 20:28:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1133. [2019-12-27 20:28:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2019-12-27 20:28:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2398 transitions. [2019-12-27 20:28:04,219 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2398 transitions. Word has length 68 [2019-12-27 20:28:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:28:04,219 INFO L462 AbstractCegarLoop]: Abstraction has 1133 states and 2398 transitions. [2019-12-27 20:28:04,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:28:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2398 transitions. [2019-12-27 20:28:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 20:28:04,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:28:04,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:28:04,223 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:28:04,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:28:04,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1544266897, now seen corresponding path program 2 times [2019-12-27 20:28:04,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:28:04,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595767314] [2019-12-27 20:28:04,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:28:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:28:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:28:04,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595767314] [2019-12-27 20:28:04,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:28:04,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:28:04,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [933326295] [2019-12-27 20:28:04,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:28:04,628 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:28:04,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 107 transitions. [2019-12-27 20:28:04,684 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:28:04,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:28:04,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:28:04,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:28:04,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:28:04,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:28:04,686 INFO L87 Difference]: Start difference. First operand 1133 states and 2398 transitions. Second operand 3 states. [2019-12-27 20:28:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:28:04,704 INFO L93 Difference]: Finished difference Result 964 states and 1995 transitions. [2019-12-27 20:28:04,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:28:04,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-27 20:28:04,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:28:04,706 INFO L225 Difference]: With dead ends: 964 [2019-12-27 20:28:04,706 INFO L226 Difference]: Without dead ends: 964 [2019-12-27 20:28:04,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:28:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-12-27 20:28:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2019-12-27 20:28:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-12-27 20:28:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1995 transitions. [2019-12-27 20:28:04,719 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1995 transitions. Word has length 68 [2019-12-27 20:28:04,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:28:04,719 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1995 transitions. [2019-12-27 20:28:04,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:28:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1995 transitions. [2019-12-27 20:28:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 20:28:04,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:28:04,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:28:04,724 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:28:04,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:28:04,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1098481905, now seen corresponding path program 1 times [2019-12-27 20:28:04,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:28:04,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772494849] [2019-12-27 20:28:04,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:28:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:28:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:28:04,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772494849] [2019-12-27 20:28:04,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:28:04,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:28:04,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [23705912] [2019-12-27 20:28:04,856 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:28:04,878 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:28:04,971 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 199 transitions. [2019-12-27 20:28:04,971 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:28:04,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:28:04,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:28:04,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:28:04,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:28:04,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:28:04,976 INFO L87 Difference]: Start difference. First operand 964 states and 1995 transitions. Second operand 5 states. [2019-12-27 20:28:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:28:05,205 INFO L93 Difference]: Finished difference Result 1102 states and 2243 transitions. [2019-12-27 20:28:05,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:28:05,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 20:28:05,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:28:05,209 INFO L225 Difference]: With dead ends: 1102 [2019-12-27 20:28:05,209 INFO L226 Difference]: Without dead ends: 1102 [2019-12-27 20:28:05,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:28:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-12-27 20:28:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1049. [2019-12-27 20:28:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2019-12-27 20:28:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 2149 transitions. [2019-12-27 20:28:05,219 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 2149 transitions. Word has length 69 [2019-12-27 20:28:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:28:05,220 INFO L462 AbstractCegarLoop]: Abstraction has 1049 states and 2149 transitions. [2019-12-27 20:28:05,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:28:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 2149 transitions. [2019-12-27 20:28:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 20:28:05,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:28:05,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:28:05,222 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:28:05,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:28:05,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1282334367, now seen corresponding path program 2 times [2019-12-27 20:28:05,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:28:05,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798297624] [2019-12-27 20:28:05,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:28:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:28:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:28:05,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798297624] [2019-12-27 20:28:05,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:28:05,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:28:05,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [346208164] [2019-12-27 20:28:05,311 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:28:05,334 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:28:05,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 106 transitions. [2019-12-27 20:28:05,391 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:28:05,392 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:28:05,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:28:05,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:28:05,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:28:05,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:28:05,393 INFO L87 Difference]: Start difference. First operand 1049 states and 2149 transitions. Second operand 3 states. [2019-12-27 20:28:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:28:05,430 INFO L93 Difference]: Finished difference Result 1048 states and 2147 transitions. [2019-12-27 20:28:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:28:05,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-27 20:28:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:28:05,433 INFO L225 Difference]: With dead ends: 1048 [2019-12-27 20:28:05,433 INFO L226 Difference]: Without dead ends: 1048 [2019-12-27 20:28:05,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:28:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-27 20:28:05,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 963. [2019-12-27 20:28:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-27 20:28:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1993 transitions. [2019-12-27 20:28:05,450 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1993 transitions. Word has length 69 [2019-12-27 20:28:05,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:28:05,451 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1993 transitions. [2019-12-27 20:28:05,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:28:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1993 transitions. [2019-12-27 20:28:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 20:28:05,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:28:05,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:28:05,453 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:28:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:28:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1085334984, now seen corresponding path program 1 times [2019-12-27 20:28:05,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:28:05,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386111737] [2019-12-27 20:28:05,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:28:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:28:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:28:05,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386111737] [2019-12-27 20:28:05,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:28:05,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:28:05,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [318053383] [2019-12-27 20:28:05,549 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:28:05,573 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:28:06,044 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 200 transitions. [2019-12-27 20:28:06,044 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:28:06,046 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:28:06,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:28:06,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:28:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:28:06,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:28:06,048 INFO L87 Difference]: Start difference. First operand 963 states and 1993 transitions. Second operand 4 states. [2019-12-27 20:28:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:28:06,243 INFO L93 Difference]: Finished difference Result 1089 states and 2220 transitions. [2019-12-27 20:28:06,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:28:06,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-27 20:28:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:28:06,245 INFO L225 Difference]: With dead ends: 1089 [2019-12-27 20:28:06,245 INFO L226 Difference]: Without dead ends: 1089 [2019-12-27 20:28:06,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:28:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-12-27 20:28:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1075. [2019-12-27 20:28:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-12-27 20:28:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2194 transitions. [2019-12-27 20:28:06,260 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2194 transitions. Word has length 70 [2019-12-27 20:28:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:28:06,260 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 2194 transitions. [2019-12-27 20:28:06,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:28:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2194 transitions. [2019-12-27 20:28:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 20:28:06,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:28:06,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:28:06,263 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:28:06,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:28:06,263 INFO L82 PathProgramCache]: Analyzing trace with hash 905951930, now seen corresponding path program 2 times [2019-12-27 20:28:06,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:28:06,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809309987] [2019-12-27 20:28:06,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:28:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:28:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:28:06,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809309987] [2019-12-27 20:28:06,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:28:06,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:28:06,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2023631030] [2019-12-27 20:28:06,432 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:28:06,451 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:28:06,517 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 198 transitions. [2019-12-27 20:28:06,517 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:28:06,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:28:06,541 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:28:06,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:28:06,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:28:06,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:28:06,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:28:06,542 INFO L87 Difference]: Start difference. First operand 1075 states and 2194 transitions. Second operand 7 states. [2019-12-27 20:28:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:28:06,817 INFO L93 Difference]: Finished difference Result 1264 states and 2579 transitions. [2019-12-27 20:28:06,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:28:06,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-27 20:28:06,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:28:06,819 INFO L225 Difference]: With dead ends: 1264 [2019-12-27 20:28:06,820 INFO L226 Difference]: Without dead ends: 1264 [2019-12-27 20:28:06,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:28:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2019-12-27 20:28:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1140. [2019-12-27 20:28:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1140 states. [2019-12-27 20:28:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 2326 transitions. [2019-12-27 20:28:06,832 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 2326 transitions. Word has length 70 [2019-12-27 20:28:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:28:06,832 INFO L462 AbstractCegarLoop]: Abstraction has 1140 states and 2326 transitions. [2019-12-27 20:28:06,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:28:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 2326 transitions. [2019-12-27 20:28:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 20:28:06,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:28:06,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:28:06,835 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:28:06,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:28:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash -809138170, now seen corresponding path program 3 times [2019-12-27 20:28:06,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:28:06,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826984060] [2019-12-27 20:28:06,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:28:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:28:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:28:07,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826984060] [2019-12-27 20:28:07,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:28:07,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:28:07,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2012133137] [2019-12-27 20:28:07,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:28:07,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:28:07,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 180 transitions. [2019-12-27 20:28:07,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:28:07,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:28:07,378 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 20:28:07,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:28:07,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:28:07,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:28:07,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:28:07,380 INFO L87 Difference]: Start difference. First operand 1140 states and 2326 transitions. Second operand 12 states. [2019-12-27 20:28:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:28:08,639 INFO L93 Difference]: Finished difference Result 2339 states and 4803 transitions. [2019-12-27 20:28:08,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:28:08,640 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-12-27 20:28:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:28:08,644 INFO L225 Difference]: With dead ends: 2339 [2019-12-27 20:28:08,645 INFO L226 Difference]: Without dead ends: 2339 [2019-12-27 20:28:08,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-12-27 20:28:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2019-12-27 20:28:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 1339. [2019-12-27 20:28:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-12-27 20:28:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2774 transitions. [2019-12-27 20:28:08,663 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2774 transitions. Word has length 70 [2019-12-27 20:28:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:28:08,663 INFO L462 AbstractCegarLoop]: Abstraction has 1339 states and 2774 transitions. [2019-12-27 20:28:08,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:28:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2774 transitions. [2019-12-27 20:28:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 20:28:08,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:28:08,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:28:08,666 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:28:08,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:28:08,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1274905568, now seen corresponding path program 1 times [2019-12-27 20:28:08,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:28:08,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866737717] [2019-12-27 20:28:08,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:28:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:28:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:28:08,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866737717] [2019-12-27 20:28:08,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:28:08,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:28:08,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1634010180] [2019-12-27 20:28:08,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:28:08,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:28:09,051 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 213 transitions. [2019-12-27 20:28:09,051 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:28:09,056 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:28:09,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:28:09,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:28:09,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:28:09,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:28:09,057 INFO L87 Difference]: Start difference. First operand 1339 states and 2774 transitions. Second operand 12 states. [2019-12-27 20:28:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:28:09,820 INFO L93 Difference]: Finished difference Result 2869 states and 5869 transitions. [2019-12-27 20:28:09,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 20:28:09,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-12-27 20:28:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:28:09,822 INFO L225 Difference]: With dead ends: 2869 [2019-12-27 20:28:09,822 INFO L226 Difference]: Without dead ends: 266 [2019-12-27 20:28:09,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-12-27 20:28:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-27 20:28:09,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 242. [2019-12-27 20:28:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-27 20:28:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 404 transitions. [2019-12-27 20:28:09,826 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 404 transitions. Word has length 71 [2019-12-27 20:28:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:28:09,827 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 404 transitions. [2019-12-27 20:28:09,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:28:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 404 transitions. [2019-12-27 20:28:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 20:28:09,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:28:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:28:09,828 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:28:09,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:28:09,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1907394154, now seen corresponding path program 2 times [2019-12-27 20:28:09,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:28:09,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030590325] [2019-12-27 20:28:09,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:28:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:28:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:28:09,945 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:28:09,945 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:28:09,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_44| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= |v_ULTIMATE.start_main_~#t597~0.offset_18| 0) (= v_~main$tmp_guard1~0_18 0) (= v_~x$mem_tmp~0_13 0) (= v_~x$r_buff1_thd2~0_40 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~x$r_buff0_thd1~0_20) (= 0 v_~x$w_buff0_used~0_146) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x$flush_delayed~0_23 0) (= 0 v_~x$r_buff0_thd2~0_78) (= v_~x$r_buff1_thd1~0_18 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t597~0.base_24| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t597~0.base_24|) |v_ULTIMATE.start_main_~#t597~0.offset_18| 0)) |v_#memory_int_15|) (= v_~x$w_buff1_used~0_78 0) (= 0 v_~__unbuffered_cnt~0_14) (= v_~x$r_buff1_thd0~0_37 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t597~0.base_24| 4) |v_#length_17|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t597~0.base_24|) (= 0 v_~x$read_delayed_var~0.offset_8) (= (store .cse0 |v_ULTIMATE.start_main_~#t597~0.base_24| 1) |v_#valid_42|) (= 0 v_~x$read_delayed~0_7) (= 0 v_~y~0_8) (= 0 v_~x$w_buff1~0_36) (= 0 v_~x$r_buff0_thd0~0_70) (= |v_#NULL.offset_4| 0) (= v_~x~0_39 0) (= 0 v_~x$w_buff0~0_39) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t597~0.base_24|)) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 0 v_~__unbuffered_p1_EAX~0_8) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_23, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_21|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_12|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_13|, ULTIMATE.start_main_~#t597~0.base=|v_ULTIMATE.start_main_~#t597~0.base_24|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, #length=|v_#length_17|, ULTIMATE.start_main_~#t597~0.offset=|v_ULTIMATE.start_main_~#t597~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_8|, ~x$w_buff1~0=v_~x$w_buff1~0_36, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_40, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_14|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_14|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_12|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ULTIMATE.start_main_~#t598~0.base=|v_ULTIMATE.start_main_~#t598~0.base_24|, ~x~0=v_~x~0_39, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_~#t598~0.offset=|v_ULTIMATE.start_main_~#t598~0.offset_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_13|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_14|, ~y~0=v_~y~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_15|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_12|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t597~0.base, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t597~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet47, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t598~0.base, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t598~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 20:28:09,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L797-1-->L799: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t598~0.base_13|) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t598~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t598~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t598~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t598~0.base_13|) |v_ULTIMATE.start_main_~#t598~0.offset_11| 1))) (= 0 (select |v_#valid_27| |v_ULTIMATE.start_main_~#t598~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t598~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t598~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t598~0.offset=|v_ULTIMATE.start_main_~#t598~0.offset_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t598~0.base=|v_ULTIMATE.start_main_~#t598~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t598~0.offset, #length, ULTIMATE.start_main_~#t598~0.base] because there is no mapped edge [2019-12-27 20:28:09,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 1 v_~x$w_buff0_used~0_106) (= v_~x$w_buff1_used~0_59 v_~x$w_buff0_used~0_107) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff0~0_25 v_~x$w_buff1~0_20) (= 0 (mod v_~x$w_buff1_used~0_59 256)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 2 v_~x$w_buff0~0_24)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_25, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_24, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 20:28:09,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L759-2-->L759-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite11_Out-113895294| |P1Thread1of1ForFork1_#t~ite12_Out-113895294|)) (.cse2 (= (mod ~x$w_buff0_used~0_In-113895294 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-113895294 256)))) (or (and .cse0 (not .cse1) (= ~x$w_buff0~0_In-113895294 |P1Thread1of1ForFork1_#t~ite11_Out-113895294|) (not .cse2)) (and .cse0 (= ~x$w_buff1~0_In-113895294 |P1Thread1of1ForFork1_#t~ite11_Out-113895294|) (or .cse2 .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-113895294, ~x$w_buff1~0=~x$w_buff1~0_In-113895294, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-113895294, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-113895294} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-113895294, ~x$w_buff1~0=~x$w_buff1~0_In-113895294, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-113895294|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-113895294|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-113895294, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-113895294} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 20:28:09,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~x$r_buff0_thd2~0_58 v_~x$r_buff0_thd2~0_57) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:28:09,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-144822637 256) 0))) (or (and (not .cse0) (= ~x$mem_tmp~0_In-144822637 |P1Thread1of1ForFork1_#t~ite31_Out-144822637|)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-144822637| ~x~0_In-144822637) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-144822637, ~x$mem_tmp~0=~x$mem_tmp~0_In-144822637, ~x~0=~x~0_In-144822637} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-144822637, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-144822637|, ~x$mem_tmp~0=~x$mem_tmp~0_In-144822637, ~x~0=~x~0_In-144822637} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 20:28:09,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2087593664 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-2087593664 256) 0)) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-2087593664| |P0Thread1of1ForFork0_#t~ite3_Out-2087593664|))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-2087593664| ~x~0_In-2087593664) .cse0 (or .cse1 .cse2)) (and (not .cse1) (not .cse2) .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-2087593664| ~x$w_buff1~0_In-2087593664)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2087593664, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2087593664, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2087593664, ~x~0=~x~0_In-2087593664} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-2087593664|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-2087593664|, ~x$w_buff1~0=~x$w_buff1~0_In-2087593664, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2087593664, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2087593664, ~x~0=~x~0_In-2087593664} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 20:28:09,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In497343142 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In497343142 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out497343142| ~x$w_buff0_used~0_In497343142)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out497343142| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In497343142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In497343142} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out497343142|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In497343142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In497343142} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:28:09,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1585135092 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1585135092 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1585135092|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1585135092 |P1Thread1of1ForFork1_#t~ite34_Out1585135092|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1585135092, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1585135092} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1585135092|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1585135092, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1585135092} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:28:09,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In1418996082 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1418996082 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1418996082 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1418996082 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out1418996082| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out1418996082| ~x$w_buff1_used~0_In1418996082) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1418996082, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1418996082, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1418996082, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1418996082} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1418996082, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1418996082, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1418996082|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1418996082, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1418996082} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:28:09,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L777-->L778: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2120418350 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2120418350 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out2120418350 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In2120418350 ~x$r_buff0_thd2~0_Out2120418350)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2120418350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120418350} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2120418350, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2120418350|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120418350} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:28:09,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In-1077394512 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1077394512 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1077394512 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1077394512 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1077394512| ~x$r_buff1_thd2~0_In-1077394512) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1077394512| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1077394512, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1077394512, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1077394512, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1077394512} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1077394512, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1077394512, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1077394512, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1077394512|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1077394512} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:28:09,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_35 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_35, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:28:09,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1910637016 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1910637016 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1910637016 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1910637016 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1910637016 |P0Thread1of1ForFork0_#t~ite6_Out1910637016|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1910637016| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1910637016, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1910637016, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1910637016, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1910637016} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1910637016|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1910637016, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1910637016, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1910637016, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1910637016} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:28:09,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In722089328 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In722089328 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out722089328|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In722089328 |P0Thread1of1ForFork0_#t~ite7_Out722089328|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In722089328, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722089328} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In722089328, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out722089328|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722089328} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 20:28:09,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1161366203 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1161366203 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1161366203 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1161366203 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1161366203| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1161366203| ~x$r_buff1_thd1~0_In-1161366203)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1161366203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1161366203, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1161366203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1161366203} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1161366203, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1161366203|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1161366203, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1161366203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1161366203} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:28:09,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 20:28:09,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_46 256)) (= (mod v_~x$w_buff0_used~0_101 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 20:28:09,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1174605869 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1174605869 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1174605869| ~x~0_In-1174605869)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In-1174605869 |ULTIMATE.start_main_#t~ite40_Out-1174605869|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1174605869, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1174605869, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1174605869, ~x~0=~x~0_In-1174605869} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1174605869|, ~x$w_buff1~0=~x$w_buff1~0_In-1174605869, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1174605869, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1174605869, ~x~0=~x~0_In-1174605869} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:28:09,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 20:28:09,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-596585801 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-596585801 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-596585801 |ULTIMATE.start_main_#t~ite42_Out-596585801|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-596585801|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-596585801, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-596585801} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-596585801, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-596585801|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-596585801} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:28:09,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1589358311 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1589358311 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1589358311 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1589358311 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1589358311| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1589358311| ~x$w_buff1_used~0_In1589358311) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1589358311, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1589358311, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1589358311, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1589358311} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1589358311, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1589358311, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1589358311|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1589358311, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1589358311} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:28:09,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2075562974 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2075562974 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out2075562974| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out2075562974| ~x$r_buff0_thd0~0_In2075562974)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2075562974, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2075562974} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2075562974, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2075562974|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2075562974} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:28:09,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In691991961 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In691991961 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In691991961 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In691991961 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In691991961 |ULTIMATE.start_main_#t~ite45_Out691991961|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out691991961| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In691991961, ~x$w_buff1_used~0=~x$w_buff1_used~0_In691991961, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In691991961, ~x$w_buff0_used~0=~x$w_buff0_used~0_In691991961} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In691991961, ~x$w_buff1_used~0=~x$w_buff1_used~0_In691991961, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In691991961, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out691991961|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In691991961} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:28:09,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1495513653 256)))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out-1495513653| ~x~0_In-1495513653) .cse0) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite68_Out-1495513653| ~x$mem_tmp~0_In-1495513653)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1495513653, ~x$mem_tmp~0=~x$mem_tmp~0_In-1495513653, ~x~0=~x~0_In-1495513653} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1495513653, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1495513653|, ~x$mem_tmp~0=~x$mem_tmp~0_In-1495513653, ~x~0=~x~0_In-1495513653} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 20:28:09,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x~0_32 |v_ULTIMATE.start_main_#t~ite68_14|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~x$flush_delayed~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_12 256))) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_14|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_13|, ~x~0=v_~x~0_32, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:28:10,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:28:10 BasicIcfg [2019-12-27 20:28:10,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:28:10,095 INFO L168 Benchmark]: Toolchain (without parser) took 32221.60 ms. Allocated memory was 145.2 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 101.8 MB in the beginning and 655.8 MB in the end (delta: -554.1 MB). Peak memory consumption was 877.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:28:10,096 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 20:28:10,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.61 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 155.6 MB in the end (delta: -54.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:28:10,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.65 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 152.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 20:28:10,098 INFO L168 Benchmark]: Boogie Preprocessor took 42.62 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:28:10,099 INFO L168 Benchmark]: RCFGBuilder took 1042.45 ms. Allocated memory is still 202.9 MB. Free memory was 149.6 MB in the beginning and 93.8 MB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:28:10,099 INFO L168 Benchmark]: TraceAbstraction took 30247.90 ms. Allocated memory was 202.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 93.2 MB in the beginning and 655.8 MB in the end (delta: -562.6 MB). Peak memory consumption was 811.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:28:10,103 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.61 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 155.6 MB in the end (delta: -54.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.65 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 152.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.62 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1042.45 ms. Allocated memory is still 202.9 MB. Free memory was 149.6 MB in the beginning and 93.8 MB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30247.90 ms. Allocated memory was 202.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 93.2 MB in the beginning and 655.8 MB in the end (delta: -562.6 MB). Peak memory consumption was 811.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 189 ProgramPointsBefore, 114 ProgramPointsAfterwards, 244 TransitionsBefore, 139 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 33 ChoiceCompositions, 10101 VarBasedMoverChecksPositive, 239 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 164896 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] FCALL, FORK 0 pthread_create(&t598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L750] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L751] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L752] 2 x$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 x$flush_delayed = weak$$choice2 [L758] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L760] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L761] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L762] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 x = x$flush_delayed ? x$mem_tmp : x [L768] 2 x$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 y = 1 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L774] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 x$flush_delayed = weak$$choice2 [L815] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L817] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L818] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L819] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L819] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2831 SDtfs, 2841 SDslu, 5601 SDs, 0 SdLazy, 3433 SolverSat, 186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 48 SyntacticMatches, 26 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49001occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 24355 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 732 NumberOfCodeBlocks, 732 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 647 ConstructedInterpolants, 0 QuantifiedInterpolants, 108398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...